Logistic map as a block encryption algorithm

  title={Logistic map as a block encryption algorithm},
  author={Ljupco Kocarev and Goce Jakimoski},
  journal={Physics Letters A},

Tables from this paper

Asymmetric Key Cipher Based on Non-Linear Dynamics

  • G. GeethaM. Kumar
  • Computer Science, Mathematics
    2008 First International Conference on Emerging Trends in Engineering and Technology
  • 2008
A novel asymmetric key chaotic cipher is proposed using random process, non linear dynamics and measures to quantify chaos to solve the problem in cryptography.

A Novel Block Encryption Based on Chaotic Map

Simulation results show that the proposed chaotic block cryptographic scheme based on Chebyschev map has excellent cryptographic properties such as diffusion and confusion properties and it can resist the know-plain text attacks and chosen-plaintext attacks.

A chaotic block encryption scheme based on the piecewise nonlinear map

Simulation results show that the proposed chaotic block cryptographic scheme based on the coupled piecewise nonlinear map has excellent cryptographic properties such as diffusion and confusion properties and it can resist the know plain- text attacks and chosen plain-text attacks.

Public-key encryption with chaos.

This work proposes public-key encryption algorithms based on chaotic maps, which are generalization of well-known and commercially used algorithms: Rivest-Shamir-Adleman, ElGamal, and Rabin, and shows that this algorithm is as secure as RSA algorithm.

An improved chaotic encryption scheme

Various parameters used for comparative assessment show that the proposed scheme is better than the existing ones in terms of functionality, strength and suitability for applications in securing messages on networks and work files on stand-alone databases.

Algebraic break of image ciphers based on discretized chaotic map lattices


A chaotic cryptosystem based on the Pwlcm map and two logistic maps that enhances the security and practicability and the numerical simulation proves the proposed algorithm effective and secure.

On the inadequacy of the logistic map for cryptographic applications

The most important characteristics of the logistic map are shown in order to prove the inconvenience of considering this map in the design of new chaotic cryptosystems.



Chaos and cryptography: block encryption ciphers based on chaotic maps

Using the well-known principles in the cryptanalysis it is shown that these ciphers do not behave worse than the standard ones, opening in this way a novel approach to the design of block encryption cipher.

Cryptography with chaos

On the Derivation of a "Chaotic" Encryption Algorithm

This paper derives a “chaotic” function, and shows that it may be suitable for cryptographic use, in particular as a replacement for the one-time pad system.

Supercomputer Investigations of a Chaotic Encryption Algorithm

A numerical investigation of the non-linear pseudo-random number generator's properties using a Cray Y-MP machine suggests that the cycling problem can be combatted to any desired degree.

Dynamical cryptography based on synchronised chaotic systems

A 2 bit dynamical data cryptosystem based entirely on the Lorenz system is presented to demonstrate its effectiveness and prevent intruders from recovering the information signals by statistical methods.

Problems with Chaotic Cryptosystems

A function based on chaos theory for generating sequences of random numbers to be used like a one-time pad, but the cycle length turns out to be unpredictable and often short.

Communication theory of secrecy systems

  • C. Shannon
  • Computer Science, Mathematics
    Bell Syst. Tech. J.
  • 1949
A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.

Recent Developments in the Design of Conventional Cryptographic Algorithms

An overview of the design principles of a large number of recent proposals for cryptographic primitives, which includes the global structure, the number of rounds, the way of introducing non-linearity and diffusion, and the key schedule are provided.

Advances in Cryptology — EUROCRYPT ’91

  • D. Davies
  • Computer Science, Mathematics
    Lecture Notes in Computer Science
  • 2001
The applicability of differential cryptanalysis to the Feal family of encryption algorithms and to the N-Hash hash function is shown.

Differential Cryptanalysis of the Data Encryption Standard

This book introduces a new cryptographic method, called differential cryptanalysis, which can be applied to analyze cryptosystems, and describes the cryptanalysis of DES, deals with the influence of its building blocks on security, and analyzes modified variants.