Pseudorandomness of MISTY-type transformations and the block cipher KASUMI

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

Abstract

We examine the security of block ciphers on the view point of pseudorandomness. Firstly we show that the four round (unbalanced) MISTY-type and the three round dual MISTY-type transformations are pseudorandom permutation ensembles. Secondly we prove that the three round KASUMI is not a pseudorandom permutation ensemble but the four round KASUMI is a pseudorandom permutation ensemble. We provide simplified probability-theoretic proofs for non-adaptive distinguishers.

Cite

CITATION STYLE

APA

Kang, J. S., Yi, O., Hong, D., & Cho, H. (2001). Pseudorandomness of MISTY-type transformations and the block cipher KASUMI. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2119, pp. 60–73). Springer Verlag. https://doi.org/10.1007/3-540-47719-5_7

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