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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ETSI/SAGE, Specification of the 3GPP Confidentiality and Integrity Algorithms, available at http://www.etsi.org/dvbandca/3GPP/3gppspecs.htm
H. Gilbert and M. Minier, New results on the pseudorandomness of some block cipher constructions, Preproceedings of Fast Software Encryption workshop 2001, (2001, Yokohama), pp. 260–277.
T. Iwata and K. Kurosawa, On the pseudorandomness of the AES finalists-RC6 and Serpent, Preproceedings of Fast Software Encryption workshop 2000, (2000, New York).
T. Iwata, T. Yoshino, T. Yuasa, and K. Kurosawa, Round security and superpseudorandomness of MISTY type structure, Preproceedings of Fast Software Encryption workshop 2001, (2001, Yokohama), pp. 245–259.
M. Luby and C. Rackoff, How to construct pseudorandom permutations and pseudorandom functions, SIAM J. Comput., Vol. 17, 1988, pp. 189–203.
M. Matsui, New permutation of Block Ciphers with Provable Security against Differential and Linear Cryptalaysis, Fast Software Encryption, LNCS 1039, Springer-Verlag, 1996, pp. 205–218.
M. Matsui, New Block Encryption Algorithm MISTY, Fast Software Encryption’97, LNCS 1267, Springer-Verlag, 1997, pp. 54–68.
U. M. Maurer, A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators, Advances in Cryptology-Eurocrypt’92, LNCS 658, Springer-Verlag, 1992, pp. 239–255.
M. Naor and O. Reingold, On the construction of pseudorandom permutations: Luby-Rackoff revisited, J. Cryptology, Vol. 12, 1999, pp. 29–66.
K. Sakurai and Y. Zheng, On non-pseudorandomness from block ciphers with provable immunity against linear cryptanaysis, IEICE Trans. Fundamentals, Vol. E80-A, No. 1, 1997, pp. 19–24.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kang, JS., Yi, O., Hong, D., Cho, H. (2001). Pseudorandomness of MISTY-Type Transformations and the Block Cipher KASUMI. In: Varadharajan, V., Mu, Y. (eds) Information Security and Privacy. ACISP 2001. Lecture Notes in Computer Science, vol 2119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47719-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-47719-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42300-3
Online ISBN: 978-3-540-47719-8
eBook Packages: Springer Book Archive