Improving the upper bound on the maximum differential and the maximum linear hull probability for SPN structures and AES

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

Volumn 2887, Issue , 2003, Pages 247-260

  Park, Sangwoo ^a   Sung, Soo Hak ^b   Lee, Sangjin ^c   Lim, Jongin ^c  

^a National Security Research Institute (NSRI)   (South Korea)

^b PaiChai University   (South Korea)

^c Korea University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TRANSFORMATIONS; LYAPUNOV METHODS; MATHEMATICAL TRANSFORMATIONS;

BRANCH NUMBER; DIFFERENTIAL PROBABILITIES; UPPER BOUND;

PROBABILITY DISTRIBUTIONS;

EID: 0242487613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39887-5_19     Document Type: Article

References (15)

1. Kazumaro Aoki, Tetsuya Ichikawa, Masayuki Kanda, Mitsuru Matsui, Shiho Moriai, Junko Nakajima, and Toshio Tokita. Camellia: A 128-bit block cipher suitable for multiple platforms - design and analysis. In Douglas R. Stinson and Stafford Tavares, editors, Selected Areas in Cryptography, volume 2012 of Lecture Notes in Computer Science, pages 39-56. Springer, 2000.
2. Eli Biham and Adi Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, 4(1):3-72, 1991.
3. C.E.Shannon. Communication Theory of Secrecy System. Bell System Technical Journal, 28:656-715, October 1949.
4. Joan Daemēn, René Govaerts, and Joos Vandwalle. Correlation matrices. In Bart Preneel, editor, Fast Software Encryption, Second International Workshop, volume 1008 of Lecture Notes in Computer Science, pages 275-285. Springer, 1994.
5. Joan Daemen, Lars R. Knudsen, and Vincent Rijmen. The block cipher square. In Eli Biham, editor, Fast Software Encryption, 4th International Workshop, volume 1267 of Lecture Notes in Computer Science, pages 149-165. Springer, 1997.
6. Joan Daemen and Vincent Rijmen. Rijndael, AES Proposal. http://www.nist.gov/aes, 1998.
7. Seokhie Hong, Sangjin Lee, Jongin Lim, Jaechul Sung, Donghyeon Cheon, and Inho Cho. Provable security against differential and linear cryptanalysis for the SPN structure. In Bruce Schneier, editor, Fast Software Encryption, 7th International Workshop, volume 1978 of Lecture Notes in Computer Science, pages 273-283. Springer, 2000.
8. Ju-Sung Kang, Seokhie Hong, Sangjin Lee, Okyeon Yi, Choonsik Park, and Jongin Lim. Practical and provable security against differential and linear cryptanalysis for substitution-permutation networks. ETRI Journal, 23(4):158-167, 2001.
9. Liam Keliher, Henk Meijer, and Stafford Tavares. Improving the upper bound on the maximum average linear hull probability for Rijndael. In Serge Vaudenay and Arnr M. Youssef, editors, Selected Areas in Cryptography, 8th Annual International Workshop, volume 2259 of Lecture Notes in Computer Science, pages 112-128. Springer, 2001.
10. Liam Keliher, Henk Meijer, and Stafford Tavares. New method for upper bounding the maximum average linear hull probability for SPNs. In Birgit Pfitzmann, editor, Advances in Cryptology - Eurocrypt 2001, volume 2045 of Lecture Notes in Computer Science, pages 420-436. Springer-Verlag, Berlin, 2001.
11. Chae Hoon Lim. CRYPTON, AES Proposal, http://www.nist.gov/aes, 1998.
12. Mitsuru Matsui. Linear cryptanalysis method for DES cipher. In Tor Helleseth, editor, Advances in Cryptology - Eurocrypt'93, volume 765 of Lecture Notes in Computer Science, pages 386-397. Springer-Verlag, Berlin, 1994.
13. NTT-Nippon Telegraph and Telephone Corporation. E2: Efficient Encryption algorithm, AES Proposal, http://www.nist.gov/aes, 1998.
14. National Institute of Standards and Technology. FIPS PUB 197 : Advanced Encryption Standard(AES), November 2001.
15. Sangwoo Park, Soo Hak Sung, Seongtaek Chee, E-Joong Yoon, and Jongin Lim. On the security of Rijndael-like structures against differential and linear cryptanalysis. In Yuliang Zheng, editor, Advances in Cryptology - Asiacrypt 2002, volume 2501 of Lecture Notes in Computer Science, pages 176-191. Springer, 2002.