Skip to main content
SpringerLink
Log in

On the Pseudorandomness of KASUMI Type Permutations

  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2727))

Included in the following conference series:

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.

See [5] for a long version. Most of the proofs are omitted in this proceedings version.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://www.3gpp.org/.

    Google Scholar 

  2. 3GPP TS 35.202 v 3.1.1. Specification of the 3GPP confidentiality and integrity algorithms, Document 2: KASUMI specification. Available at http://www.3gpp.org/tb/other/algorithms.htm.

    Google Scholar 

  3. Evaluation report (version 2.0). Specification of the 3GPP confidentiality and integrity algorithms, Report on the evaluation of 3GPP confidentiality and integrity algorithms. Available at http://www.3gpp.org/tb/other/algorithms.htm.

    Google Scholar 

  4. M. Blunden and A. Escott. Related key attacks on reduced round KASUMI. Fast Software Encryption, FSE 2001, LNCS 2355, pp. 277–285, Springer-Verlag, 2002.

    Chapter  Google Scholar 

  5. T. Iwata, T. Yagi, and K. Kurosawa. On the pseudorandomness of KASUMI type permutations. A long version of this paper. Available from the authors and Cryptology ePrint Archive, http://eprint.iacr.org/.

    Google Scholar 

  6. J. S. Kang, S. U. Shin, D. Hong, and O. Yi. Provable security of KASUMI and 3GPP encryption mode f8. Advances in Cryptology — ASIACRYPT 2001, LNCS 2248, pp. 255–271, Springer-Verlag, 2001.

    Chapter  Google Scholar 

  7. J. S. Kang, O. Yi, D. Hong, and H. Cho. Pseudorandomness of MISTY-type transformations and the block cipher KASUMI. Information Security and Privacy, The 6th Australasian Conference, ACISP 2001, LNCS 2119, pp. 60–73, Springer-Verlag, 2001.

    Google Scholar 

  8. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput., vol. 17, no. 2, pp. 373–386, April 1988.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. Matsui. New structure of block ciphers with provable security against differential and linear cryptanalysis. Fast Software Encryption, FSE’ 96, LNCS 1039, pp. 206–218, Springer-Verlag.

    Google Scholar 

  10. M. Matsui. New block encryption algorithm MISTY. Fast Software Encryption, FSE’ 97, LNCS 1267, pp. 54–68, Springer-Verlag.

    Chapter  Google Scholar 

  11. K. Sakurai and Y. Zheng. On non-pseudorandomness from block ciphers with provable immunity against linear cryptanalysis. IEICE Trans. Fundamentals, vol. E80-A, no. 1, pp. 19–24, April 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Sciences, Ibaraki University, 4-12-1 Nakanarusawa, Hitachi, Ibaraki, 316-8511, Japan

    Tetsu Iwata & Kaoru Kurosawa

  2. Department of Communications and Integrated Systems, Tokyo Institute of Technology, 2-12-1 O-okayama, Meguro, Tokyo, 152-8552, Japan

    Tohru Yagi

Authors
  1. Tetsu Iwata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tohru Yagi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kaoru Kurosawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technology and Computer Science, University of Wollongong, Wollongong, NSW, 2522, Australia

    Rei Safavi-Naini  & Jennifer Seberry  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iwata, T., Yagi, T., Kurosawa, K. (2003). On the Pseudorandomness of KASUMI Type Permutations. In: Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 2003. Lecture Notes in Computer Science, vol 2727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45067-X_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45067-X_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40515-3

  • Online ISBN: 978-3-540-45067-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation