Prikladnaya Diskretnaya Matematika. Supplement
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


Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika. Supplement, 2013, Issue 6, Pages 33–35 (Mi pdma90)  
Mathematical Methods of Cryptography

On probability characteristics of random graphs generated by algorithms for finding hash function collisions

G. A. Karpunin

M. V. Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
Full-text PDF (499 kB)
References:
PDF
HTML
Abstract: In the paper, a graph model of some algorithms for finding SHA-1 and RIPEMD collisions is described, and under the described model, an exact formula for calculating average complexity of these algorithms is given.
Keywords: cryptographic hash functions, collisions, random graphs.
Document Type: Article
UDC: 519.17, 004.056.2, 004.056.53
Language: Russian
Citation: G. A. Karpunin, “On probability characteristics of random graphs generated by algorithms for finding hash function collisions”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 33–35
Citation in format AMSBIB
\Bibitem{Kar13}
\by G.~A.~Karpunin
\paper On probability characteristics of random graphs generated by algorithms for finding hash function collisions
\jour Prikl. Diskr. Mat. Suppl.
\yr 2013
\issue 6
\pages 33--35
\mathnet{http://mi.mathnet.ru/pdma90}
Linking options:
  • https://www.mathnet.ru/eng/pdma90
  • https://www.mathnet.ru/eng/pdma/y2013/i6/p33
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025