作者: Somitra Kumar Sanadhya , Palash Sarkar
DOI: 10.1007/978-3-540-85886-7_17
关键词: Differential (infinitesimal) 、 Round function 、 Hash function 、 SHA-2 、 Path (graph theory) 、 Construct (python library) 、 Discrete mathematics 、 Theoretical computer science 、 Computer science 、 Cryptanalysis
摘要: Recently, at FSE '08, Nikolic and Biryukov introduced a new technique for analyzing SHA-2 round function. Building on their work, but using other differential paths, we construct two different deterministic attacks against 21-step hash family. Since the are deterministic, they actually combinatorial constructions of collisions. There six free words in our first construction. This gives exactly 2192different collisions SHA-256 2384different SHA-512. The second construction has five words. best previous result, due to Biryukov, finding holds with probability 2i¾? 19. No results SHA-512 previously known. Further, provide evidence that Nikolic-Biryukov path is unlikely yield