Distinguishing Property for Full Round KECCAK-f Permutation

  • Maolin Li
  • Lu Cheng
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 611)


Hash function is one of the most important cryptographic primitives. It plays a vital role in security communication to protect data’s integrity and authenticity. \( {\text{K}}{\textsc{eccak}} \) is a hash function selected by NIST as the winner of the SHA-3 competition. The inner primitive of \( {\text{K}}{\textsc{eccak}} \) is a permutation named by \( {\text{K}}{\textsc{eccak}} \)-f. In this paper, we present improved bounds for the degree of the inverse of iterated \( {\text{K}}{\textsc{eccak}} \)-f. By using this bound, we improve the zero-sum distinguisher of full 24 rounds \( {\text{K}}{\textsc{eccak}} \)-f permutation by lowering the size of the zero-sum partition from 21579 to 21573.



The authors would like to thank the anonymous referees for their valuable remarks and their helpful comments.


  1. 1.
    Aumasson, J.P., Meier, W.: Zero-sum distinguishers for reduced KECCAK-f and for the core functions of Luffa and Hamsi. In: Presented at the Rump Session of Cryptographic Hardware and Embedded Systems (CHES 2009) (2009)Google Scholar
  2. 2.
    Boura, C., Canteaut, A.: Zero-sum distinguishers for iterated permutation and applicaton to KECCAK-f and Hamsi-256. In: Selected Areas in Cryptography (SAC 2010). LNCS, vol. 6544, pp. 1–17. Springer, Heidelberg (2010)Google Scholar
  3. 3.
    Watanabe, D., Hatano, Y., Yamada, T., Kaneko, T.: Higher order differential attacks on step-reduced variants of luffa v1. In: Fast Software Encryption (FSE 2010). LNCS, vol. 6147, pp. 270–285. Springer, Heidelberg (2010)Google Scholar
  4. 4.
    Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The KECCAK sponge function family. Main document. Submission to NIST (Round 2) (2009)Google Scholar
  5. 5.
    Boura, C., Canteaut, A.: A zero-sum property for the KECCAK-f permutation with 18 rounds. In: IEEE International Symposium on Information Theory 2010, 1–9 2010, Austin, Texas: United States (2010)Google Scholar
  6. 6.
    Boura, C., Canteaut, A., Canniere, C.D.: Higher-order differential properties of KECCAK and luffa. In: FSE 2011. LNCS, vol. 6733, pp. 252–269. Springer, Heidelberg (2011)Google Scholar
  7. 7.
    Duan, M., Lai, X.J.: Improved zero-sum distinguisher for full round KECCAK-f permutation. Sci. Bullet. 75(6), 694–697 (2012)CrossRefGoogle Scholar
  8. 8.
    Bertoni, G., Daemen, J., Peeters, M., Assche, G. V.: Keccak implementation overview:
  9. 9.
    Knudsen, L.R., Rijmen, V.: Known-key distinguishers for some block ciphers. In: ASIACRYPT 2007. LNCS, vol. 4833, pp. 315–324. Springer, Heidelberg (2007)Google Scholar
  10. 10.
    Knudsen, L.R.: Truncated and higher order differentials. In: Fast Software Encryption (FSE 1994). LNCS, vol. 1008, pp. 196–211. Springer, Heidelberg (1995)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Nan Kai University Binhai CollegeTianjinChina
  2. 2.Engineering University of Armed Police ForceXi’anChina

Personalised recommendations