Displaying similar documents to “Cryptanalysis and improvement of a block cipher based on multiple chaotic systems.”

Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check

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...

A related-key attack on iterated chaotic ciphers

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...

Parallel algorithm for spatially one-and two-dimensional initial-boundary-value problem for a parabolic equation

Pavol Purcz (2001)

Kybernetika

Similarity:

A generalization of the spatially one-dimensional parallel pipe-line algorithm for solution of the initial-boundary-value problem using explicit difference method to the two-dimensional case is presented. The suggested algorithm has been verified by implementation on a workstation-cluster running under PVM (Parallel Virtual Machine). Theoretical estimates of the speed-up are presented.