A differential attack on the CIKS-1 block cipher
Brian J. Kidney, Howard M. Heys, Theodore S. Norvell
Abstract
Brian J. Kidney, Howard M. Heys, Theodore S. Norvell
Abstract
A. and N. Moldovyan (see J. Cryptology, vol.15, p.61-72, 2002) introduced a cipher, called CIKS-1, with security based mainly on data-dependent permutations (DDPs). The goal of the cipher was to exploit the speed and simplicity of DDPs to create a fast hardware-oriented block cipher. In the original paper, the authors claimed that the cipher is immune to differential cryptanalysis. This paper investigates the propagation of differentials through the cipher. An attack is then presented to reveal the last subkey of the cipher with a data complexity better than previously claimed.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A. and N. Moldovyan (see J. Cryptology, vol.15, p.61-72, 2002) introduced a cipher, called CIKS-1, with security based mainly on data-dependent permutations (DDPs). The goal of the cipher was to exploit the speed and simplicity of DDPs to create a fast hardware-oriented block cipher. In the original paper, the authors claimed that the cipher is immune to differential cryptanalysis. This paper investigates the propagation of differentials through the cipher. An attack is then presented to reveal the last subkey of the cipher with a data complexity better than previously claimed.
Key concepts: Block cipher, Cipher, Two-square cipher, Differential cryptanalysis, Computer science, Transposition cipher, Cryptography, Running key cipher