Presentation 2004-07-20
A More Efficient Modification of KASUMI Type Pseudorandom Permutations
Wonil LEE, Kouichi SAKURAI, Seokhie HONG, Sangjin LEE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We present a modjfication of the KASUMI type permutations and analyze the security of it using the notion of pseudorandomness. Our modification is similar to the KASUMI type permutations except the use of just two round MISTY-type permutation as the round function. Note that the values of each round functions of two round MISTY-type permutation can be computed simultaneously. So our modified permuatation can be computed more efficiently than the original KASUMI type permuation. Furthermore our results have a sligtly more good (or same) upper bound of success probablity of arbitrary attacker in the sense of (super) pseudorandomness.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) KASUMI block cipher / Pseudorandomness / Provable security
Paper # ISEC2004-17
Date of Issue

Conference Information
Committee ISEC
Conference Date 2004/7/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A More Efficient Modification of KASUMI Type Pseudorandom Permutations
Sub Title (in English)
Keyword(1) KASUMI block cipher
Keyword(2) Pseudorandomness
Keyword(3) Provable security
1st Author's Name Wonil LEE
1st Author's Affiliation Faculty of Information Science and Electrical Engineering()
2nd Author's Name Kouichi SAKURAI
2nd Author's Affiliation Faculty of Information Science and Electrical Engineering
3rd Author's Name Seokhie HONG
3rd Author's Affiliation Center for Information and Security Technologies(CIST), Korea University
4th Author's Name Sangjin LEE
4th Author's Affiliation Center for Information and Security Technologies(CIST), Korea University
Date 2004-07-20
Paper # ISEC2004-17
Volume (vol) vol.104
Number (no) 199
Page pp.pp.-
#Pages 8
Date of Issue