Cryptography and Communications

, Volume 7, Issue 3, pp 331–345 | Cite as

The parallel-cut meet-in-the-middle attack

Article

Abstract

We propose a new type of meet-in-the-middle attack that splits a cryptographic primitive in parallel to the execution flow of the operations. The result of the division are two primitives that have smaller input sizes and thus require lower attack complexities. The sub-primitives are not completely independent, but mutually depend on a certain number of bits. When the number of such bits is relatively small, we show a technique based on three classical meet-in-the-middle attacks that can recover the secret key of the cipher faster than an exhaustive search. We apply our findings to the lightweight block cipher Klein and show attacks on 10/11/13 rounds of Klein-64/-80/-96. We note that our approach works in the known-plaintext attack model and requires only one or two pairs of known plaintexts.

References

  1. 1.
    Aumasson, J.-P., Naya-Plasencia, M., Saarinen, M.-J.: Practical attack on 8 rounds of the lightweight block cipher KLEIN. In: Bernstein, D., Chatterjee, S. (eds.) Progress in Cryptology INDOCRYPT 2011, Lecture Notes in Computer Science, vol. 7107, pp. 134–145. Springer, Berlin / Heidelberg (2011)Google Scholar
  2. 2.
    Biham, E., Chen, R: Near-collisions of SHA-0. In: Franklin, M. (ed.) Advances in Cryptology - CRYPTO 2004, Lecture Notes in Computer Science, vol. 3152, pp. 199–214. Springer, Berlin / Heidelberg (2004)Google Scholar
  3. 3.
    Bouillaguet, C., Derbez, P., Dunkelman, O., Fouque, P.-A., Keller, N., Rijmen, V.: Low-data complexity attacks on AES. IEEE Trans. Inf. Theory 58(11), 7002–7017 (2012)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Diffie, W., Hellman, M.E.: Special feature exhaustive cryptanalysis of the NBS data encryption standard. Comput. 10(6), 74–84 (1977)CrossRefGoogle Scholar
  5. 5.
    Dinur, I., Dunkelman, O., Shamir, A.: Improved attacks on full GOST. In: Canteaut, A. (ed.) FSE, Lecture Notes in Computer Science, vol. 7549, pp. 9–28. Springer (2012)Google Scholar
  6. 6.
    Dunkelman, O., Sekar, G., Preneel, B.: Improved meet-in-the-middle attacks on reduced-round DES. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT, Lecture Notes in Computer Science, vol. 4859, pp. 86–100. Springer (2007)Google Scholar
  7. 7.
    Gong, Z., Nikova, S., Law, Y.: KLEIN: A new family of lightweight block ciphers. In: Juels, A., Paar, C. (eds.) RFID. Security and Privacy, Lecture Notes in Computer Science, vol. 7055, pp. 1–18. Springer, Berlin / Heidelberg (2012)Google Scholar
  8. 8.
    Lallemand, V., Naya-Plasencia, M.: Cryptanalysis of KLEIN FSE. To appear (2014)Google Scholar
  9. 9.
    Leurent, G. In: S. Moriai (ed.) : Cryptanalysis of WIDEA. Springer (2013)Google Scholar
  10. 10.
    Morita, H., Ohta, K., Miyaguchi, S.: A switching closure test to analyze cryptosystems. In: Feigenbaum, J. (ed.) Advances in Cryptology — CRYPTO 1991, Lecture Notes in Computer Science, vol. 576, pp. 183–193. Springer, Berlin / Heidelberg (1992)Google Scholar
  11. 11.
    Yu, X., Wu, W., Li, Y., Zhang, L.: Cryptanalysis of reduced-round KLEIN block cipher. In: Wu, C., Yung, M., Lin, D. (eds.) Inscrypt, Lecture Notes in Computer Science, vol. 7537, pp. 237–250 Springer (2011)Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Nanyang Technological UniversityNanyangSingapore
  2. 2.HuaweiSingaporeSingapore

Personalised recommendations