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.
N1 - Funding Information:
For the nancial support of this work the authors wish to thank the State Scholarship Foundation (SSF) and the Secretariat of Research and Technology of Greece (GSRT) with PENED contract.
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
AN - SCOPUS:0035652952
SN - 0218-1274
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
IS - 12
ER -