Saturation attacks on reduced round Skipjack

Kyungdeok Hwang, Wonil Lee, Sungjae Lee, Sangjin Lee, Jong In Lim

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

8 Citations (Scopus)

Abstract

This paper describes saturation attacks on reduced-round versions of Skipjack. To begin with, we will show how to construct a 16-round distinguisher which distinguishes 16 rounds of Skipjack from a random permutation. The distinguisher is used to attack on 18(5~22) and 23(5~27) rounds of Skipjack. We can also construct a 20-round distinguisher based on the 16-round distinguisher. This distinguisher is used to attack on 22(1~22) and 27(1~27) rounds of Skipjack. The 80-bit user key of 27 rounds of Skipjack can be recovered with 250 chosen plaintexts and 3 · 275 encryption times.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages100-111
Number of pages12
Volume2365
ISBN (Print)9783540440093
Publication statusPublished - 2002
Event9th International Workshop on Fast Software Encryption, FSE 2002 - Leuven, Belgium
Duration: 2002 Feb 42002 Feb 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2365
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other9th International Workshop on Fast Software Encryption, FSE 2002
CountryBelgium
CityLeuven
Period02/2/402/2/6

Fingerprint

Cryptography
Saturation
Attack
Random Permutation
Encryption

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Hwang, K., Lee, W., Lee, S., Lee, S., & Lim, J. I. (2002). Saturation attacks on reduced round Skipjack. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2365, pp. 100-111). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2365). Springer Verlag.

Saturation attacks on reduced round Skipjack. / Hwang, Kyungdeok; Lee, Wonil; Lee, Sungjae; Lee, Sangjin; Lim, Jong In.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2365 Springer Verlag, 2002. p. 100-111 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2365).

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

Hwang, K, Lee, W, Lee, S, Lee, S & Lim, JI 2002, Saturation attacks on reduced round Skipjack. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2365, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2365, Springer Verlag, pp. 100-111, 9th International Workshop on Fast Software Encryption, FSE 2002, Leuven, Belgium, 02/2/4.
Hwang K, Lee W, Lee S, Lee S, Lim JI. Saturation attacks on reduced round Skipjack. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2365. Springer Verlag. 2002. p. 100-111. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Hwang, Kyungdeok ; Lee, Wonil ; Lee, Sungjae ; Lee, Sangjin ; Lim, Jong In. / Saturation attacks on reduced round Skipjack. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2365 Springer Verlag, 2002. pp. 100-111 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{48ad0233506148b0810305883cdf09da,
title = "Saturation attacks on reduced round Skipjack",
abstract = "This paper describes saturation attacks on reduced-round versions of Skipjack. To begin with, we will show how to construct a 16-round distinguisher which distinguishes 16 rounds of Skipjack from a random permutation. The distinguisher is used to attack on 18(5~22) and 23(5~27) rounds of Skipjack. We can also construct a 20-round distinguisher based on the 16-round distinguisher. This distinguisher is used to attack on 22(1~22) and 27(1~27) rounds of Skipjack. The 80-bit user key of 27 rounds of Skipjack can be recovered with 250 chosen plaintexts and 3 · 275 encryption times.",
author = "Kyungdeok Hwang and Wonil Lee and Sungjae Lee and Sangjin Lee and Lim, {Jong In}",
year = "2002",
language = "English",
isbn = "9783540440093",
volume = "2365",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "100--111",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Saturation attacks on reduced round Skipjack

AU - Hwang, Kyungdeok

AU - Lee, Wonil

AU - Lee, Sungjae

AU - Lee, Sangjin

AU - Lim, Jong In

PY - 2002

Y1 - 2002

N2 - This paper describes saturation attacks on reduced-round versions of Skipjack. To begin with, we will show how to construct a 16-round distinguisher which distinguishes 16 rounds of Skipjack from a random permutation. The distinguisher is used to attack on 18(5~22) and 23(5~27) rounds of Skipjack. We can also construct a 20-round distinguisher based on the 16-round distinguisher. This distinguisher is used to attack on 22(1~22) and 27(1~27) rounds of Skipjack. The 80-bit user key of 27 rounds of Skipjack can be recovered with 250 chosen plaintexts and 3 · 275 encryption times.

AB - This paper describes saturation attacks on reduced-round versions of Skipjack. To begin with, we will show how to construct a 16-round distinguisher which distinguishes 16 rounds of Skipjack from a random permutation. The distinguisher is used to attack on 18(5~22) and 23(5~27) rounds of Skipjack. We can also construct a 20-round distinguisher based on the 16-round distinguisher. This distinguisher is used to attack on 22(1~22) and 27(1~27) rounds of Skipjack. The 80-bit user key of 27 rounds of Skipjack can be recovered with 250 chosen plaintexts and 3 · 275 encryption times.

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

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

M3 - Conference contribution

SN - 9783540440093

VL - 2365

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

SP - 100

EP - 111

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

PB - Springer Verlag

ER -