We congratulate Ling Song^1,2,3, Guohong Liao^4,1 and Jian Guo¹ for solving the 6-round collision challenge on Keccak[r=1440, c=160].

The collision search took a computational effort of about 2⁵⁰ evaluations of the Keccak-f rounds. It follows an improvement of the technique previously used for solving the 5-round collision challenge in May last year (then solved by Jian Guo, Meicheng Liu, Ling Song and Kexin Qiao).

1. Cryptanalysis Taskforce, Temasek Laboratories @ Nanyang Technological University, Singapore
2. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, China
3. Data Assurance and Communication Security Research Center, Chinese Academy of Sciences, China
4. South China Normal University, China