Publication
This paper, shows that for the FFT-hash function proposed by Schnorr (1992), finding a collision requires about 224 computations of the basic FFT function. This can be done in few hours on SUN4-workstation. The proposed FFT hash-function can be inverted with 248 basic computations. Some simple improvements are proposed to try to get rid of the weaknesses
Stéphane Bonjour, Jérémie Stoeckli
Marilyne Andersen, Jan Wienold, Caroline Karmann, Sneha Jain
Jian Wang, Matthias Finger, Lesya Shchutska, Qian Wang, Matthias Wolf, Varun Sharma, Konstantin Androsov, Jan Steggemann, Roberto Castello, Alessandro Degano, João Miguel das Neves Duarte, Lei Zhang, Tian Cheng, Yixing Chen, Werner Lustermann, Andromachi Tsirou, Alexis Kalogeropoulos, Andrea Rizzi, Ioannis Papadopoulos, Paolo Ronchese, Thomas Muller, Ho Ling Li, Giuseppe Codispoti, Paul Turner, Wei Sun, Raffaele Tito D'Agnolo, Ji Hyun Kim, Donghyun Kim, Dipanwita Dutta, Zheng Wang, Sanjeev Kumar, Wei Li, Yong Yang, Ajay Kumar, Ashish Sharma, Georgios Anagnostou, Joao Varela, Csaba Hajdu, Muhammad Ahmad, Ekaterina Kuznetsova, Ioannis Evangelou, Matthias Weber, Muhammad Shoaib, Milos Dordevic, Vineet Kumar, Vladimir Petrov, Francesco Fiori, Quentin Python, Hao Liu, Sourav Sen, Gurpreet Singh, Xiao Wang, Kai Yi, Rajat Gupta, Shuai Liu, Aram Avetisyan, Yu Zheng, Charles Dietz, Alexandre Aubin, Michal Simon, Matteo Marone, Giovanni Bianchi, Yifei Guo