Collision Attack and Pseudorandomness of Reduced-Round Camellia 1

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3357, Issue , 2004, Pages 252-266

  Wenling, Wu ^a   Dengguo, Feng ^a   Hua, Chen ^a  

^a INSTITUTE OF SOFTWARE   (China)

Author keywords

Block cipher; Camellia; Data complexity; Pseudorandomness; Time complexity

Indexed keywords

RANDOM PROCESSES; SECURITY OF DATA; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY;

BLOCK CIPHERS; BLOCK SPACE; CAMELLIA; COLLISION ATTACK; DATA COMPLEXITY; DISTINGUISHERS; PSEUDORANDOM PERMUTATION; PSEUDORANDOMNESS; RANDOM PERMUTATIONS; TIME COMPLEXITY;

CRYPTOGRAPHY; BLOCK CODES;

BLOCK CIPHERS; CAMELLIA; DATA COMPLEXITY; PSEUDORANDOMNESS; TIME COMPLEXITY;

EID: 24144485414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30564-4_18     Document Type: Article

References (16)

1. K.Aoki,T.Ichikawa,M.Kanda,M.Matsui,S.Moriai,J.Nakajima and T.Tokita, "Specification of Camellia-a 128-bit Block Cipher," Selected Areas in Cryptography - SAC'2000, Springer-Verlag 2000,pp. 183-191.
2. http://www.cryptonessie.org
3. T.Kawabata, T.Kaneko, "A study on higher order differential attack of Camellia," Proceedings of the 2nd NESSIE workshop,2001.
4. Y.Hatano,H.Sekine, and T.Kaneko, "Higher order differential attack of Camellia(II),"Selected Areas in Cryptography-S'AC'02, LNCS 2595,Springer-Verlag 2002, pp.39-56.
5. S. Lee, S. Hong, S. Lee, J. Lim and S. Yoon, "Truncated Differential Cryptanalysis of Camellia", Information Security and Cryptology-ICISC'01, LNCS 2288, SpringerVerlag,2001,pp.32-38.
6. M.Sugita,K.Kobara, and H.Imai, "Security of reduced version of the block cipher Camellia against truncated and impossible differential cryptanalysis," Advances in Cryptology- Asiacrypt'01,LNCS 2248,Springer-Verlag 2001, pp.193-207.
7. T.Shirai,S.Kanamaru,and G.Abe, "Improved upper bounds of differential and linear characteristic probability for Camellia," Fast Software EncryptionFSE'02,LNCS 2365,Springer-Verlag 2002,pp.128-142.
8. He Ye-ping and Qing Si-han, "Square attack on Reduced Camellia Cipher," Information and Communication Security-ICICS'01,U3CS 2229, Springer-Verlag 2001,pp.238-245.
9. Y.Yeom, S.Park, and I. Kirn, "On the security of Camellia against the square attack," Fast Software Encryption-FSE'OS,LNCS 2356, Springer-Verlag 2002,pp.89-99.
10. Y.Yeom, I. Park, and I. Kim, "A study of Integral type cryptanalysis on Camellia," The 2003 Symposium on Cryptography and Information Security-SCIS'03.
11. M. Luby and C. Rackoff, " How to construct pseudorandom permutations from pseudorandom functions," SIAM Journal on Computing, Vol. 17,No.2,(1988),pp.373-386.
12. J.Patarin, " New results on pseudorandom permutation generators based on the DES Scheme," Advances in Cryptology-Crypto'91, Springer-Verlag 1991,pp.72-77.
13. U.M.Maurer, "A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators," Advances in Cryptology-Eurocrypt'92, LNCS 658,Springer-Verlag 1992,pp.239-255.
14. S. Vaudenay, "Provable security for block ciphers by decorrelation," In Proc. of STACS'98, LNCS 1373, Springer-Verlag 1998,pp.249-275.
15. T.Iwata and K. Kurosawa, "On the Pseudorandomness of the AES Finalists-RC6 and Serpent," Fast Software Encryption-FES'2000, LNCS 1978, Springer-Verlag 2000,pp.231-243,.
16. M.Naor and O.Reingold, "On the construction of pseudorandom permutations Luby-Rackoff revisited," Journal of Cryptology, Vol.12, No.l,pp.29-66,1999.