On the pseudorandomness of a modification of KASUMI type permutations

Wonil Lee; Kouichi Sakurai; Seokhie Hong; Sangjin Lee

doi:10.1007/11496618_23

On the pseudorandomness of a modification of KASUMI type permutations

Wonil Lee, Kouichi Sakurai, Seokhie Hong, Sangjin Lee

Mathematical Informatics

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

Abstract

We present a modification of KASUMI type permutations and analyze the security of it using the notion of pseudorandomness. Our modified KASUMI type permutation can be computed more efficiently than the original KASUMI type permutation. Furthermore, our results have a slightly better (same) upper bound of success probability against arbitrary attackers in the sense of (super) pseudorandomness.

Original language	English
Pages (from-to)	313-329
Number of pages	17
Journal	Lecture Notes in Computer Science
Volume	3506
DOIs	https://doi.org/10.1007/11496618_23
Publication status	Published - 2005
Event	7th International Conference on Information Security and Cryptology - ICISC 2004 - Seoul, Korea, Republic of Duration: Dec 2 2004 → Dec 3 2004

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11496618_23

Cite this

@article{8113e0cae80c42fb86347ad8993807a3,

title = "On the pseudorandomness of a modification of KASUMI type permutations",

abstract = "We present a modification of KASUMI type permutations and analyze the security of it using the notion of pseudorandomness. Our modified KASUMI type permutation can be computed more efficiently than the original KASUMI type permutation. Furthermore, our results have a slightly better (same) upper bound of success probability against arbitrary attackers in the sense of (super) pseudorandomness.",

author = "Wonil Lee and Kouichi Sakurai and Seokhie Hong and Sangjin Lee",

year = "2005",

doi = "10.1007/11496618_23",

language = "English",

volume = "3506",

pages = "313--329",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

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

}

TY - JOUR

T1 - On the pseudorandomness of a modification of KASUMI type permutations

AU - Lee, Wonil

AU - Sakurai, Kouichi

AU - Hong, Seokhie

AU - Lee, Sangjin

PY - 2005

Y1 - 2005

N2 - We present a modification of KASUMI type permutations and analyze the security of it using the notion of pseudorandomness. Our modified KASUMI type permutation can be computed more efficiently than the original KASUMI type permutation. Furthermore, our results have a slightly better (same) upper bound of success probability against arbitrary attackers in the sense of (super) pseudorandomness.

AB - We present a modification of KASUMI type permutations and analyze the security of it using the notion of pseudorandomness. Our modified KASUMI type permutation can be computed more efficiently than the original KASUMI type permutation. Furthermore, our results have a slightly better (same) upper bound of success probability against arbitrary attackers in the sense of (super) pseudorandomness.

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

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

U2 - 10.1007/11496618_23

DO - 10.1007/11496618_23

M3 - Conference article

AN - SCOPUS:24944447760

SN - 0302-9743

VL - 3506

SP - 313

EP - 329

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 -

On the pseudorandomness of a modification of KASUMI type permutations

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this