A Simple and Provably Good Code for SHA Message Expansion.
作者： Anindya C. Patthak , Charanjit S. Jutla
DOI:
关键词:
摘要: We develop a new computer assisted technique for lower bounding the minimum distance of linear codes similar to those used in SHA-1 message expansion. Using this technique, we prove that modified like code has at least 82, and too just last 64 80 expanded words. Further weight 60 words (last 48 words) is 75 (52 respectively). propose compression function which identical except expansion code. argue high makes resistant recent differential attacks.
参考文章(14)
Kristine Lally, Quasicyclic codes of index l over F q viewed as F q [x]-submodules of F q l [x]/ċ x m ċ1ċ Lecture Notes in Computer Science. ,vol. 2643, pp. 244- 253 ,(2003) , 10.1007/3-540-44828-4_26
Luca Trevisan, Andrej Bogdanov, On Worst-Case to Average-Case Reductions for NP Problems Electronic Colloquium on Computational Complexity. ,(2005)
Vincent Rijmen, Elisabeth Oswald, Update on SHA-1 Lecture Notes in Computer Science. pp. 58- 71 ,(2005) , 10.1007/978-3-540-30574-3_6
Krystian Matusiewicz, Josef Pieprzyk, Finding Good Differential Patterns for Attacks on SHA-1 Coding and Cryptography. pp. 164- 177 ,(2006) , 10.1007/11779360_14
Xiaoyun Wang, Yiqun Lisa Yin, Hongbo Yu, Finding collisions in the full SHA-1 international cryptology conference. pp. 17- 36 ,(2005) , 10.1007/11535218_2
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)
Florent Chabaud, Antoine Joux, Differential Collisions in SHA-0 international cryptology conference. pp. 56- 71 ,(1998) , 10.1007/BFB0055720
A. Vardy, The intractability of computing the minimum distance of a code IEEE Transactions on Information Theory. ,vol. 43, pp. 1757- 1766 ,(1997) , 10.1109/18.641542
T. Schoning, A probabilistic algorithm for k-SAT and constraint satisfaction problems foundations of computer science. pp. 410- 414 ,(1999) , 10.1109/SFFCS.1999.814612
Xiaoyun Wang, Hongbo Yu, Yiqun Lisa Yin, Efficient collision search attacks on SHA-0 international cryptology conference. pp. 1- 16 ,(2005) , 10.1007/11535218_1