How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
Higher Order Differential Attack of Camellia (II)
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Provable Security for Block Ciphers by Decorrelation
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
New Results on Pseudorandom Permutation Generators Based on the DES Scheme
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On the Pseudorandomness of the AES Finalists - RC6 and Serpent
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Improved Upper Bounds of Differential and Linear Characteristic Probability for Camellia
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Truncated Differential Cryptanalysis of Camellia
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Square Attack on Reduced Camellia Cipher
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
On the Security of CAMELLIA against the Square Attack
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Impossible differential cryptanalysis of reduced-round ARIA and Camellia
Journal of Computer Science and Technology
New impossible differential attacks of reduced-round Camellia-192 and Camellia-256
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Integral cryptanalysis of reduced FOX block cipher
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
New impossible differential cryptanalysis of reduced-round camellia
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
New impossible differential attacks on camellia
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Low data complexity attack on reduced camellia-256
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
New observations on impossible differential cryptanalysis of reduced-round camellia
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
| Hi-index | 0.00 |
Camellia is the final winner of 128-bit block cipher in NESSIE. In this paper, we construct some efficient distinguishers between 4-round Camellia and random permutation of the blocks space. By using collision-searching techniques, the distinguishers are used to attack 6,7,8 and 9 rounds of Camellia with 128-bit key and 8,9 and 10 rounds of Camellia with 192/256-bit key. The attack on 6-round of 128-bit key Camellia is more efficient than known attacks. The complexities of the attack on 7(8,9,10)-round Camellia without FL /FL−−1 functions are less than that of previous attacks. Furthermore, we prove that the 4-round primitive-wise idealized Camellia is not pseudorandom permutation and the 5-round primitive-wise idealized Camellia is super-pseudorandom permutation for non-adaptive adversaries.