Some Hints for the Design of Digital Chaos-Based Cryptosystems: Lessons Learned from Cryptanalysis

Arroyo, David; Álvarez, Gonzalo; Li, Shujun

doi:10.3182/20090622-3-uk-3004.00034

Cited by 12 publications

(3 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…According to our experience in the field of the cryptanalysis of chaos-based cryptosystems, the most critical problems in chaotic cryptography arise from three elements: the selection of a chaotic system, the choice of an encryption architecture, and the implementation of the encryption. Next those problems are listed and discussed, according to our previous works in [67,24,21].…”

Section: Main Problems In Chaos-based Cryptographymentioning

confidence: 99%

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

Álvarez

Amigó

Arroyo

et al. 2011

Studies in Computational Intelligence

Self Cite

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

Section: Main Problems In Chaos-based Cryptographymentioning

confidence: 99%

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

Álvarez

Amigó

Arroyo

et al. 2011

Studies in Computational Intelligence

Self Cite

View full text Add to dashboard Cite

show abstract

“…From the above discussion, we see clearly that cryptanalysis works are so important because they help revealing vulnerabilities in encryption schemes and facilitate the development of cryptography in general [24]. They can also prevent unsafe encryption algorithms from spreading and being applied to actual communications with real sensitive data.…”

Section: Introductionmentioning

confidence: 99%

Cryptanalysis of a Pixel Permutation Based Image Encryption Technique Using Chaotic Map

Mokhnache¹,

Ziet²

2020

View full text Add to dashboard Cite

Recently, a new image encryption algorithm was proposed by Anwar and Meghana. This encryption scheme uses the Arnold's chaotic cat map to permute the image pixels. The resulting image is then confused with both a secret image provided as part of the secret key and a secret value selected randomly from the permuted image. Using a random image as part of the secret key, gives this algorithm an infinite key space which increases its efficiency against brute-force attacks. In order to help improving the security of modern image encryption schemes, this paper presents a cryptanalysis of the proposed algorithm using a combination of chosen-plaintext and brute-force attacks. First, the infinite key space that the secret image offers is broken using a chosen-plaintext attack. Then, the permutation phase is reversed through a series of chosen-plaintext attacks too. Finally, the secret value chosen randomly from the permuted image is easily brute-forced due to its reduced number of possible values. By applying the above method, it is possible to restore the plain version of any image that was encrypted using the former encryption algorithm. Thus, relying on this algorithm to encrypt real sensitive data is not secure.

show abstract

“…Se han desarrollado otras aplicaciones de codificación para demostrar de forma experimental el proceso de sincronización de varios circuitos receptores, sin necesidad de acoplamiento alguno entre ellos (Núñez, 2012). En esta investigación se presenta un algoritmo de cifrado que utiliza las propiedades de los sistemas caóticos para codificar información, se toman en cuenta las recomendaciones de otras investigaciones de utilizar varias órbitas caóticas mezcladas o truncadas con la finalidad de que sea más difícil para un atacante detectarlas (Ranjan y Saumitr, 2006;Arroyo et al, 2008). A diferencia del algoritmo realizado por Pareek et al (2005) el sistema que se propone no se basa en el cifrado utilizando solo las propiedades de confusión y difusión que proporcionan los sistemas caóticos.…”

Section: Introductionunclassified