Modified Baptista type chaotic cryptosystem via matrix secret key

Ariffin, Muhammad Rezal Kamel; Noorani, Mohd Salmi Md

doi:10.1016/j.physleta.2008.06.077

Cited by 34 publications

(50 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The key element of the system is the symmetric tent mapT that is applied to every state on the torus X ∈ [−1, 1] p in Equation (6): (1) n ) T(x (2) n ) . .…”

Section: Description Of the Piecewise Linear (Pwl) Chaotic Mapmentioning

confidence: 99%

“…. , x (p) n ) can be rewritten from control point of view with output vector Y n = (y (1) n , y (2) n , . .…”

Section: Description Of the Piecewise Linear (Pwl) Chaotic Mapmentioning

confidence: 99%

“…2 The mapping M p is defined in algorithmic way by (1) and (2), in order to highlight how it is built using the symmetric tent map of the interval [−1, 1] together with the very weak coupling between components.…”

Section: Introductionmentioning

confidence: 99%

“…It can be defined in a more traditional mathematical fashion using modulo function: (2) n + e 1 x (1) n )) mod 1) − 1 (3) n + e 2 x (2) n )) mod 1) − 1 . .…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

How useful randomness for cryptography can emerge from multicore-implemented complex networks of chaotic maps

Garasym¹,

Lozi

2017

Journal of Difference Equations and Applications

View full text Add to dashboard Cite

show abstract

“…The key element of the system is the symmetric tent mapT that is applied to every state on the torus X ∈ [−1, 1] p in Equation (6): (1) n ) T(x (2) n ) . .…”

Section: Description Of the Piecewise Linear (Pwl) Chaotic Mapmentioning

confidence: 99%

“…. , x (p) n ) can be rewritten from control point of view with output vector Y n = (y (1) n , y (2) n , . .…”

Section: Description Of the Piecewise Linear (Pwl) Chaotic Mapmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…It can be defined in a more traditional mathematical fashion using modulo function: (2) n + e 1 x (1) n )) mod 1) − 1 (3) n + e 2 x (2) n )) mod 1) − 1 . .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

How useful randomness for cryptography can emerge from multicore-implemented complex networks of chaotic maps

Garasym¹,

Lozi

2017

Journal of Difference Equations and Applications

View full text Add to dashboard Cite

show abstract

“…This rule is not satisfied in the scenarios drawn by [31,34,20], partial knowledge of the key can be used to obtain the rest of the key [11,26,95].…”

Section: Problems With the Encryption Architecturementioning

confidence: 99%

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

Álvarez

Amigó

Arroyo

et al. 2011

Studies in Computational Intelligence

View full text Add to dashboard Cite

The idea of using chaotic transformations in cryptography is explicit in the foundational papers of Shannon on secrecy systems (e.g., [96]). Although the word "chaos" was not minted till the 1970s [71], Shannon clearly refers to this very concept when he proposes the construction of secure ciphers by means of measure-preserving, mixing maps which depend 'sensitively' on their parameters. The implementation of Shannon's intuitions had to wait till the development of Chaos Theory in the 1980s. Indeed, it was around 1990 when the first chaos-based ciphers were proposed (e.g., [78], [46]). Moreover, in 1990 chaos synchronization [91] entered the scene and shortly thereafter, the first applications to secure communications followed [56,37]. The idea is remarkably simple: mask the message with a chaotic signal and use synchronization at the receiver to filter out the chaotic signal. The realization though had to overcome the desynchronization induced by the message itself. After this initial stage, the number of proposals which exploited the properties of chaotic maps for cryptographical purposes, grew in a spectacular way.

show abstract

A variant of Baptista's encryption scheme

Kanso

Ghebleh

Noura

2015

Security Comm Networks

View full text Add to dashboard Cite

The idea of employing chaotic maps in building encryption schemes has attracted the attention of many researchers since the late 1980s. In 1998, M.S. Baptista proposed an elegant encryption scheme based on a one–dimensional chaotic map. Many variants of this scheme have been proposed. Baptista's scheme and some of its variants have been subjected to cryptanalytic attacks such as the one‐time pad attack and the entropy attack. We propose a variant of Baptista's encryption scheme based on two coupled one–dimensional chaotic maps, which also employs mixing, that is, every character in the ciphertext depends on all preceding plaintext characters. Our proposed scheme overcomes the aforementioned attacks. Empirical results show that this idea improves the performance of the scheme. Baptista's approach generates a ciphertext, which is generally larger than the plaintext, but the distribution of the ciphertext symbols allows compression. Simulation results verify that our proposed scheme accommodates better compression rates than the original scheme. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Modified Baptista type chaotic cryptosystem via matrix secret key

Cited by 34 publications

References 18 publications

How useful randomness for cryptography can emerge from multicore-implemented complex networks of chaotic maps

How useful randomness for cryptography can emerge from multicore-implemented complex networks of chaotic maps

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

A variant of Baptista's encryption scheme

Contact Info

Product

Resources

About