New method for bounding the maximum differential probability for SPNs and ARIA

Hong Su Cho, Soo Hak Sung, Daesung Kwon, Jung Keun Lee, Jung Hwan Song, Jong In Lim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

By considering the number of independent variables, we present a new method for finding an upper bound on the maximum differential probability (MDP) for r(r ≥ 2)-round substitution-permutation networks (SPNs). It first finds an upper bound for 2-round SPNs and then uses a recursive technique for r(r ≥ 3)-round SPNs. Our result extends and sharpens known results in that it is more effective for calculating MDP for r(r ≥ 3)-round SPNs and applicable to all SPNs. By applying our method to ARIA, we get an estimated bound of 1.5 × 2 -98 on MDP for 6-round ARIA.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsC. Park, S. Chee
Pages21-32
Number of pages12
Volume3506
Publication statusPublished - 2005
Event7th International Conference on Information Security and Cryptology - ICISC 2004 - Seoul, Korea, Republic of
Duration: 2004 Dec 22004 Dec 3

Other

Other7th International Conference on Information Security and Cryptology - ICISC 2004
CountryKorea, Republic of
CitySeoul
Period04/12/204/12/3

    Fingerprint

Keywords

  • AES
  • ARIA
  • Branch number
  • Cryptography
  • Differential cryptanalysis
  • Independent variables
  • Linear cryptanalysis
  • Substitution-permutation networks

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Cho, H. S., Sung, S. H., Kwon, D., Lee, J. K., Song, J. H., & Lim, J. I. (2005). New method for bounding the maximum differential probability for SPNs and ARIA. In C. Park, & S. Chee (Eds.), Lecture Notes in Computer Science (Vol. 3506, pp. 21-32)