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, Jongin Lim

Research output: Contribution to journalConference articlepeer-review

5 Citations (Scopus)


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
Pages (from-to)21-32
Number of pages12
JournalLecture Notes in Computer Science
Publication statusPublished - 2005
Event7th International Conference on Information Security and Cryptology - ICISC 2004 - Seoul, Korea, Republic of
Duration: 2004 Dec 22004 Dec 3


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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'New method for bounding the maximum differential probability for SPNs and ARIA'. Together they form a unique fingerprint.

Cite this