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

Substitution reactions

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)

New method for bounding the maximum differential probability for SPNs and ARIA. / Cho, Hong Su; Sung, Soo Hak; Kwon, Daesung; Lee, Jung Keun; Song, Jung Hwan; Lim, Jong In.

Lecture Notes in Computer Science. ed. / C. Park; S. Chee. Vol. 3506 2005. p. 21-32.

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

Cho, HS, Sung, SH, Kwon, D, Lee, JK, Song, JH & Lim, JI 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, 7th International Conference on Information Security and Cryptology - ICISC 2004, Seoul, Korea, Republic of, 04/12/2.
Cho HS, Sung SH, Kwon D, Lee JK, Song JH, Lim JI. New method for bounding the maximum differential probability for SPNs and ARIA. In Park C, Chee S, editors, Lecture Notes in Computer Science. Vol. 3506. 2005. p. 21-32
Cho, Hong Su ; Sung, Soo Hak ; Kwon, Daesung ; Lee, Jung Keun ; Song, Jung Hwan ; Lim, Jong In. / New method for bounding the maximum differential probability for SPNs and ARIA. Lecture Notes in Computer Science. editor / C. Park ; S. Chee. Vol. 3506 2005. pp. 21-32
@inproceedings{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 Lim, {Jong In}",
year = "2005",
language = "English",
volume = "3506",
pages = "21--32",
editor = "C. Park and S. Chee",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

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, Jong In

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

M3 - Conference contribution

VL - 3506

SP - 21

EP - 32

BT - Lecture Notes in Computer Science

A2 - Park, C.

A2 - Chee, S.

ER -