CIKS-1

rdf:langString CIKS-1

rdf:langString CIKS-1

rdf:langString A.A. Moldovyan and N.A. Moldovyan

rdf:langString Feistel-like network

rdf:langString In cryptography, CIKS-1 is a block cipher designed in 2002 by A.A. Moldovyan and N.A. Moldovyan. Like its predecessor, Spectr-H64, it relies heavily on permutations of bits, so is better suited to implementation in hardware than in software. The algorithm has a block size of 64 bits. It uses an 8 round structure in which half of the block determines the transformation of the other half in each round, similar to a Feistel cipher or RC5. In each round the key also undergoes a transformation dependent on the data. CIKS-1 uses four types of operations: data-dependent permutations, fixed permutations, XORs, and addition mod 4. The designers of CIKS-1 didn't specify any key schedule for the cipher, but it uses a total key size of 256 bits. Kidney, Heys, and Norvell showed that round keys of low Hamming weight are relatively weak, so keys should be chosen carefully. The same researchers have also proposed a differential cryptanalysis of CIKS-1 which uses 256 chosen plaintexts.

rdf:langString Differential attack using 256 chosen plaintexts

rdf:langString January 2002