Differential cryptanalysis of the data encryption standard
Differential cryptanalysis of the data encryption standard
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
On Differential and Linear Crytoanalysis of the RC5 Encryption Algorithm
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Linear Cryptanalysis of RC5 and RC6
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Linear Cryptanalysis of Reduced-Round Versions of the SAFER Block Cipher Family
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
A Chosen-Plaintext Linear Attack on DES
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
A new method for known plaintext attack of FEAL cipher
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
High speed networking security: design and implementation of two new DDP-based ciphers
Mobile Networks and Applications
Security analysis of the full-round DDO-64 block cipher
Journal of Systems and Software
Security analysis of the SCO-family using key schedules
Information Sciences: an International Journal
Related-key amplified boomerang attacks on the full-round eagle-64 and eagle-128
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Related-Key differential attacks on cobra-s128, cobra-f64a, and cobra-f64b
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Related-Key attacks on DDP based ciphers: CIKS-128 and CIKS-128H
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Related-Key differential attacks on cobra-h64 and cobra-h128
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
| Hi-index | 0.00 |
In this paper, we firstly evaluate the resistance of the reduced 5-round version of the block cipher CIKS-1 against linear cryptanalysis (LC). A feature of the CIKS-1 is the use of both Data-Dependent permutations(DDP) and internal key scheduing which consist in datadapendent transformation of the round subkeys. Taking into account the structure of CIKS-1 we investigate linear approximation. That is, we consider 16 linear approximations with p = 3/4 for 16 parallel modulo 22 additions to construct one-round linear approximation and derive one-round linear approximation with the probability of P = 1/2 + 2-17 by Piling-Up lemma. Also we estimate that the P is a valid probability of one-round approximation and achieve that the probability P for oneround approximation is better than 1/2 +2-17 through experiments. Then we construct 3-round linear approximation with P = 1/2 +2-17 using this one-round approximation and can attack the reduced 5-round CIKS-1 with 64-bit block by LC. In conclusion, we present that our attack requires about 236 chosen plaintexts with a probability of success of 78.5 % and 1/5 脳 232 脳 236 驴 265.7 encryption times to recover last round(5-round) key. In addition, we discuss a few improvements of the cipher CIKS-1.