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

doi:10.1007/11496618_4

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

School of Cybersecurity

Research output: Contribution to journal › Conference article › peer-review

5 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 language	English
Pages (from-to)	21-32
Number of pages	12
Journal	Lecture Notes in Computer Science
Volume	3506
DOIs	https://doi.org/10.1007/11496618_4
Publication status	Published - 2005
Event	7th International Conference on Information Security and Cryptology - ICISC 2004 - Seoul, Korea, Republic of Duration: 2004 Dec 2 → 2004 Dec 3

Keywords

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

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11496618_4

Cite this

@article{7e792b316c09401faac2ea3a2b19e4e9,

title = "New method for bounding the maximum differential probability for SPNs and ARIA",

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.",

keywords = "AES, ARIA, Branch number, Cryptography, Differential cryptanalysis, Independent variables, Linear cryptanalysis, Substitution-permutation networks",

author = "Cho, {Hong Su} and Sung, {Soo Hak} and Daesung Kwon and Lee, {Jung Keun} and Song, {Jung Hwan} and Jongin Lim",

year = "2005",

doi = "10.1007/11496618_4",

language = "English",

volume = "3506",

pages = "21--32",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "7th International Conference on Information Security and Cryptology - ICISC 2004 ; Conference date: 02-12-2004 Through 03-12-2004",

}

TY - JOUR

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

AU - Cho, Hong Su

AU - Sung, Soo Hak

AU - Kwon, Daesung

AU - Lee, Jung Keun

AU - Song, Jung Hwan

AU - Lim, Jongin

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - AES

KW - ARIA

KW - Branch number

KW - Cryptography

KW - Differential cryptanalysis

KW - Independent variables

KW - Linear cryptanalysis

KW - Substitution-permutation networks

UR - http://www.scopus.com/inward/record.url?scp=24944439811&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24944439811&partnerID=8YFLogxK

U2 - 10.1007/11496618_4

DO - 10.1007/11496618_4

M3 - Conference article

AN - SCOPUS:24944439811

SN - 0302-9743

VL - 3506

SP - 21

EP - 32

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 7th International Conference on Information Security and Cryptology - ICISC 2004

Y2 - 2 December 2004 through 3 December 2004

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this