Numerical methods and programming
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Num. Meth. Prog.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Numerical methods and programming, 2012, Volume 13, Issue 3, Pages 82–89 (Mi vmp73)  

Программирование

Finding a collision for the 75-round SHA-1 hash function using clusters of GPUs

E. A. Grechnikova, A. V. Adinetzb

a M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
b M.V. Lomonosov Moscow State University, Research Computing Center
Abstract: SHA-1 is one of the most widely used cryptographic hash functions. An important property of all cryptographic hash functions is the collision resistance, i.e., the infeasibility of finding two different input messages such that they have the same hash values. A further development of the differential attack method for SHA-1 and its reduced versions are proposed. The porting collision search based on the method of characteristics is described for GPU clusters. The method of characteristics employs the backtracking search, which leads to a low GPU performance due to branch divergence if implemented naively. Using a number of optimizations, we reduce the branch divergence and achieve a GPU usage efficiency of 50%, which gives an acceleration of 39 times over a single CPU core. With the aid of our application running on a 512-GPU cluster, we were able to find a collision for a version of SHA-1 reduced to 75 rounds, which is currently (February 2012) the world's best result in terms of number of rounds for SHA-1.
Keywords: cryptoanalysis; cryptographic hash functions; building collisions; GPU; clusters; high-performance computing.
Received: 28.06.2012
Document Type: Article
UDC: 004.021
Language: Russian
Citation: E. A. Grechnikov, A. V. Adinetz, “Finding a collision for the 75-round SHA-1 hash function using clusters of GPUs”, Num. Meth. Prog., 13:3 (2012), 82–89
Citation in format AMSBIB
\Bibitem{GreAdi12}
\by E.~A.~Grechnikov, A.~V.~Adinetz
\paper Finding a collision for the 75-round SHA-1 hash function using clusters of GPUs
\jour Num. Meth. Prog.
\yr 2012
\vol 13
\issue 3
\pages 82--89
\mathnet{http://mi.mathnet.ru/vmp73}
Linking options:
  • https://www.mathnet.ru/eng/vmp73
  • https://www.mathnet.ru/eng/vmp/v13/i3/p82
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Numerical methods and programming
    Statistics & downloads:
    Abstract page:145
    Full-text PDF :98
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024