On the pseudorandomness of a modification of KASUMI type permutations

Wonil Lee, Kouichi Sakurai, Seokhie Hong, Sangjin Lee

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

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 languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsC. Park, S. Chee
Pages313-329
Number of pages17
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

Keywords

  • Block cipher
  • KASUMI
  • Provable security
  • Pseudorandomness

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Lee, W., Sakurai, K., Hong, S., & Lee, S. (2005). On the pseudorandomness of a modification of KASUMI type permutations. In C. Park, & S. Chee (Eds.), Lecture Notes in Computer Science (Vol. 3506, pp. 313-329)

On the pseudorandomness of a modification of KASUMI type permutations. / Lee, Wonil; Sakurai, Kouichi; Hong, Seokhie; Lee, Sangjin.

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

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

Lee, W, Sakurai, K, Hong, S & Lee, S 2005, On the pseudorandomness of a modification of KASUMI type permutations. in C Park & S Chee (eds), Lecture Notes in Computer Science. vol. 3506, pp. 313-329, 7th International Conference on Information Security and Cryptology - ICISC 2004, Seoul, Korea, Republic of, 04/12/2.
Lee W, Sakurai K, Hong S, Lee S. On the pseudorandomness of a modification of KASUMI type permutations. In Park C, Chee S, editors, Lecture Notes in Computer Science. Vol. 3506. 2005. p. 313-329
Lee, Wonil ; Sakurai, Kouichi ; Hong, Seokhie ; Lee, Sangjin. / On the pseudorandomness of a modification of KASUMI type permutations. Lecture Notes in Computer Science. editor / C. Park ; S. Chee. Vol. 3506 2005. pp. 313-329
@inproceedings{130171295b85464da2e2b6559732bded,
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.",
keywords = "Block cipher, KASUMI, Provable security, Pseudorandomness",
author = "Wonil Lee and Kouichi Sakurai and Seokhie Hong and Sangjin Lee",
year = "2005",
language = "English",
volume = "3506",
pages = "313--329",
editor = "C. Park and S. Chee",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

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.

KW - Block cipher

KW - KASUMI

KW - Provable security

KW - 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

M3 - Conference contribution

AN - SCOPUS:24944447760

VL - 3506

SP - 313

EP - 329

BT - Lecture Notes in Computer Science

A2 - Park, C.

A2 - Chee, S.

ER -