Reflection Cryptanalysis of PRINCE-Like Ciphers

  • Hadi Soleimany
  • Céline Blondeau
  • Xiaoli Yu
  • Wenling Wu
  • Kaisa Nyberg
  • Huiling Zhang
  • Lei Zhang
  • Yanfeng Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8424)

Abstract

PRINCE is a low-latency block cipher presented at ASIACRYPT 2012. The cipher was designed with a property called \(\alpha \)-reflection which reduces the definition of the decryption with a given key to an encryption with a different but related key determined by \(\alpha \). In the design document, it was shown that PRINCE is secure against known attacks independently of the value of \(\alpha \), and the design criteria for \(\alpha \) remained open.

In this paper, we introduce new generic distinguishers on PRINCE-like ciphers. First, we show that, by folding the cipher in the middle, the number of rounds can be halved due to the \(\alpha \)-reflection property. Furthermore, we investigate many classes of \(\alpha \) and find the best differential characteristic for the folded cipher. For such \(\alpha \) there exist an efficient key-recovery attack on the full 12-round cipher with the data complexity of \(2^{57.98}\) known plaintexts and time complexity of \(2^{72.39}\) encryptions. With the original value of \(\alpha \) we can attack a reduced six-round version of PRINCE. As a result of the new cryptanalysis method presented in this paper, new design criteria concerning the selection of the value of \(\alpha \) for PRINCE-like ciphers are obtained.

Keywords

Block cipher \(\alpha \)-reflection property PRINCE Statistical attack Reflection attack 

Notes

Acknowledgments

We wish to thank the anonymous reviewers for helpful comments. The authors from Aalto University wish to acknowledge useful discussions with Gregor Leander during his visits funded by the Aalto Science Institute. The work of Hadi Soleimany is supported by Helsinki Doctoral Program in Computer Science - Advanced Computing and Intelligent Systems (HECSE). The work of Hadi Soleimany and Céline Blondeau is partly supported by European Commission through the ICT program under contract ICT-2007-216676 ECRYPT II. The work of Xiaoli Yu, Wenling Wu, Huiling Zhang, Lei Zhang and Yanfeng Wang is partly supported by the National Basic Research Program of China (No. 2013CB338002) and the National Natural Science Foundation of China (No. 61272476, 61232009, 61202420).

References

  1. 1.
    Blondeau, C., Gérard, B., Tillich, J.-P.: Accurate estimates of the data complexity and success probability for various cryptanalyses. Des. Codes Crypt. 59(1–3), 3–34 (2011)CrossRefMATHGoogle Scholar
  2. 2.
    Borghoff, J., et al.: PRINCE – a low-latency block cipher for pervasive computing applications (extended abstract). In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 208–225. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  3. 3.
    Bouillaguet, C., Dunkelman, O., Leurent, G., Fouque, P.-A.: Another look at complementation properties. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol. 6147, pp. 347–364. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  4. 4.
    Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, New York (2009)CrossRefMATHGoogle Scholar
  5. 5.
    Guo, J., Peyrin, T., Poschmann, A., Robshaw, M.: The LED block cipher. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 326–341. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  6. 6.
    Kara, O.: Reflection cryptanalysis of some ciphers. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 294–307. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  7. 7.
    Knudsen, L., Leander, G., Poschmann, A., Robshaw, M.J.B.: PRINTcipher: a block cipher for IC-printing. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 16–32. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  8. 8.
    Moore, J.H., Simmons, G.J.: Cycle structure of the DES with weak and semi-weak keys. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 9–32. Springer, Heidelberg (1987) CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Hadi Soleimany
    • 1
  • Céline Blondeau
    • 1
  • Xiaoli Yu
    • 2
    • 3
  • Wenling Wu
    • 2
  • Kaisa Nyberg
    • 1
  • Huiling Zhang
    • 2
  • Lei Zhang
    • 2
  • Yanfeng Wang
    • 2
  1. 1.Department of Information and Computer ScienceAalto University School of ScienceEspooFinland
  2. 2.TCA, Institute of SoftwareChinese Academy of SciencesBeijingPeople’s Republic of China
  3. 3.Graduate University of Chinese Academy of SciencesBeijingPeople’s Republic of China

Personalised recommendations