On the pseudorandomness of KASUMI type permutations

3Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

KASUMI is a block cipher which has been adopted as a standard of 3GPP. In this paper, we study the pseudorandomness of idealized KASUMI type permutations for adaptive adversaries. We show that the four round version is pseudorandom and the six round version is super-pseudorandom. © 2003 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Iwata, T., Yagi, T., & Kurosawa, K. (2003). On the pseudorandomness of KASUMI type permutations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2727 LNCS, pp. 130–141). https://doi.org/10.1007/3-540-45067-X_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free