A probabilistic symmetric encryption scheme for very fast secure communication based on chaotic systems of difference equations

S. Papadimitriou, T. Bountis, S. Mavroudi, A. Bezerianos

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

We present a new probabilistic symmetric key encryption scheme based on the chaotic dynamics of properly designed chaotic systems. This technique exploits the concept of virtual attractors, which are not real attractors of the underlying chaotic dynamics but are created and maintained artificially. Each virtual attractor represents a symbol of the alphabet used to encode messages. The state space is partitioned over the virtual attractors creating clusters of states. The enciphering process randomizes over the set of states mapped to a virtual attractor in order to construct the ciphertext for the transmited symbol. The receiver can reconstruct perfectly this virtual state space, given the possession of the same chaotic system of difference equations with parameters tuned perfectly to those of the transmitter. Therefore, from the ciphertext chunk corresponding to a state, the virtual attractor can be derived from the details of the virtual state space. The knowledge of the virtual attractor leads to the recovery of the transmitted symbol. We demonstrate that the new algorithm is secure, reliable and very fast. It uses discrete time chaotic recurrent systems and is simple, flexible and modular. These systems can be constructed easily dynamically from an alphanumeric encryption key. The cryptographic security of the algorithm is evaluated with combinatorial arguments.

Original languageEnglish
Pages (from-to)3107-3115
Number of pages9
JournalInternational Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Volume11
Issue number12
DOIs
Publication statusPublished - Dec 2001
Externally publishedYes

Fingerprint

System of Difference Equations
Secure Communication
Chaotic systems
Difference equations
Chaotic System
Encryption
Cryptography
Attractor
Transmitters
Recovery
State Space
Chaotic Dynamics
Alphanumeric
Combinatorial argument
Secure communication
Transmitter
Discrete-time
Receiver

ASJC Scopus subject areas

  • General
  • Applied Mathematics

Cite this

A probabilistic symmetric encryption scheme for very fast secure communication based on chaotic systems of difference equations. / Papadimitriou, S.; Bountis, T.; Mavroudi, S.; Bezerianos, A.

In: International Journal of Bifurcation and Chaos in Applied Sciences and Engineering, Vol. 11, No. 12, 12.2001, p. 3107-3115.

Research output: Contribution to journalArticle

@article{74e3101f44dd42aaa7b2c4532a2c0afc,
title = "A probabilistic symmetric encryption scheme for very fast secure communication based on chaotic systems of difference equations",
abstract = "We present a new probabilistic symmetric key encryption scheme based on the chaotic dynamics of properly designed chaotic systems. This technique exploits the concept of virtual attractors, which are not real attractors of the underlying chaotic dynamics but are created and maintained artificially. Each virtual attractor represents a symbol of the alphabet used to encode messages. The state space is partitioned over the virtual attractors creating clusters of states. The enciphering process randomizes over the set of states mapped to a virtual attractor in order to construct the ciphertext for the transmited symbol. The receiver can reconstruct perfectly this virtual state space, given the possession of the same chaotic system of difference equations with parameters tuned perfectly to those of the transmitter. Therefore, from the ciphertext chunk corresponding to a state, the virtual attractor can be derived from the details of the virtual state space. The knowledge of the virtual attractor leads to the recovery of the transmitted symbol. We demonstrate that the new algorithm is secure, reliable and very fast. It uses discrete time chaotic recurrent systems and is simple, flexible and modular. These systems can be constructed easily dynamically from an alphanumeric encryption key. The cryptographic security of the algorithm is evaluated with combinatorial arguments.",
author = "S. Papadimitriou and T. Bountis and S. Mavroudi and A. Bezerianos",
year = "2001",
month = "12",
doi = "10.1142/S0218127401004030",
language = "English",
volume = "11",
pages = "3107--3115",
journal = "International Journal of Bifurcation and Chaos in Applied Sciences and Engineering",
issn = "0218-1274",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "12",

}

TY - JOUR

T1 - A probabilistic symmetric encryption scheme for very fast secure communication based on chaotic systems of difference equations

AU - Papadimitriou, S.

AU - Bountis, T.

AU - Mavroudi, S.

AU - Bezerianos, A.

PY - 2001/12

Y1 - 2001/12

N2 - We present a new probabilistic symmetric key encryption scheme based on the chaotic dynamics of properly designed chaotic systems. This technique exploits the concept of virtual attractors, which are not real attractors of the underlying chaotic dynamics but are created and maintained artificially. Each virtual attractor represents a symbol of the alphabet used to encode messages. The state space is partitioned over the virtual attractors creating clusters of states. The enciphering process randomizes over the set of states mapped to a virtual attractor in order to construct the ciphertext for the transmited symbol. The receiver can reconstruct perfectly this virtual state space, given the possession of the same chaotic system of difference equations with parameters tuned perfectly to those of the transmitter. Therefore, from the ciphertext chunk corresponding to a state, the virtual attractor can be derived from the details of the virtual state space. The knowledge of the virtual attractor leads to the recovery of the transmitted symbol. We demonstrate that the new algorithm is secure, reliable and very fast. It uses discrete time chaotic recurrent systems and is simple, flexible and modular. These systems can be constructed easily dynamically from an alphanumeric encryption key. The cryptographic security of the algorithm is evaluated with combinatorial arguments.

AB - We present a new probabilistic symmetric key encryption scheme based on the chaotic dynamics of properly designed chaotic systems. This technique exploits the concept of virtual attractors, which are not real attractors of the underlying chaotic dynamics but are created and maintained artificially. Each virtual attractor represents a symbol of the alphabet used to encode messages. The state space is partitioned over the virtual attractors creating clusters of states. The enciphering process randomizes over the set of states mapped to a virtual attractor in order to construct the ciphertext for the transmited symbol. The receiver can reconstruct perfectly this virtual state space, given the possession of the same chaotic system of difference equations with parameters tuned perfectly to those of the transmitter. Therefore, from the ciphertext chunk corresponding to a state, the virtual attractor can be derived from the details of the virtual state space. The knowledge of the virtual attractor leads to the recovery of the transmitted symbol. We demonstrate that the new algorithm is secure, reliable and very fast. It uses discrete time chaotic recurrent systems and is simple, flexible and modular. These systems can be constructed easily dynamically from an alphanumeric encryption key. The cryptographic security of the algorithm is evaluated with combinatorial arguments.

UR - http://www.scopus.com/inward/record.url?scp=0035652952&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035652952&partnerID=8YFLogxK

U2 - 10.1142/S0218127401004030

DO - 10.1142/S0218127401004030

M3 - Article

VL - 11

SP - 3107

EP - 3115

JO - International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

JF - International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

SN - 0218-1274

IS - 12

ER -