Enhanced cryptography by multiple chaotic dynamics.
Chen, Jianyong, Zhou, Junwei, Wong, Kwok-Wo, Ji, Zhen (2011)
Mathematical Problems in Engineering
Similarity:
Chen, Jianyong, Zhou, Junwei, Wong, Kwok-Wo, Ji, Zhen (2011)
Mathematical Problems in Engineering
Similarity:
Angelova, Vesela, Borissov, Yuri (2013)
Serdica Journal of Computing
Similarity:
We describe an approach for recovering the plaintext in block ciphers having a design structure similar to the Data Encryption Standard but with improperly constructed S-boxes. The experiments with a backtracking search algorithm performing this kind of attack against modified DES/Triple-DES in ECB mode show that the unknown plaintext can be recovered with a small amount of uncertainty and this algorithm is highly efficient both in time and memory costs for plaintext sources with relatively...
Ulutas, Mustafa (2010)
Mathematical Problems in Engineering
Similarity:
Yang Yang, Chenhui Jin (2008)
Kybernetika
Similarity:
In this paper, we present a new type of attack on iterated chaotic ciphers using related keys. Based on the fact that a chaotic sequence is not sensitive to the less significant bits of initial conditions and parameters, a divide- and-conquer attack on iterated chaotic ciphers was presented by us before, which significantly reduces the computing complexity of attacks. However, if the information leaked is significant according to the distribution of the coincidence degrees, a measure...
Fiorella Argenti, A. De Angeli, E. Del Re, Roberto Genesio, Plinio Pagni, Alberto Tesi (1997)
Kybernetika
Similarity:
Miodrag Živković (2008)
Review of the National Center for Digitization
Similarity: