On the pseudorandomness of a modification of KASUMI type permutations

Wonil Lee, Kouichi Sakurai, Seokhie Hong, Sangjin Lee

Research output: Contribution to journalArticle

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
Pages (from-to)313-329
Number of pages17
JournalLecture Notes in Computer Science
Volume3506
Publication statusPublished - 2005

Fingerprint

Pseudorandomness
Permutation
Upper bound
Arbitrary

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

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

In: Lecture Notes in Computer Science, Vol. 3506, 2005, p. 313-329.

Research output: Contribution to journalArticle

Lee, Wonil ; Sakurai, Kouichi ; Hong, Seokhie ; Lee, Sangjin. / On the pseudorandomness of a modification of KASUMI type permutations. In: Lecture Notes in Computer Science. 2005 ; Vol. 3506. pp. 313-329.
@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",
language = "English",
volume = "3506",
pages = "313--329",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

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

M3 - Article

AN - SCOPUS:24944447760

VL - 3506

SP - 313

EP - 329

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -