Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2015, Volume 6, Issue 4, Pages 77–97
DOI: https://doi.org/10.4213/mvk169 (Mi mvk169) 		 
This article is cited in 2 scientific papers (total in 2 papers)

A complexity analysis of algorithm of parallel search of the “gold” collision

D. V. Pilshchikov

TVP Laboratory, Moscow
Full-text PDF (166 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk169
Abstract: The paper refines known estimates of time and memory complexities of Oorschot and Wiener algorithm for the “gold” collision searching. We use results related to the computation of characteristics of time-memory-data tradeoff method with distinguished points. Probabilistic approximations of the algorithm characteristics by random variables depending on the number of particles and the total number of particles in a subcritical Galton–Watson process are described.The limits of expectations of these random variables are found.
Key words: “gold” collision search, time-memory-data tradeoff with distinguished points, branching processes, one-way function inversion.
Received 20.IV.2015
Bibliographic databases:
Document Type: Article
UDC: 519.719.2+519.218.2
Language: Russian
Citation: D. V. Pilshchikov, “A complexity analysis of algorithm of parallel search of the “gold” collision”, Mat. Vopr. Kriptogr., 6:4 (2015), 77–97
Citation in format AMSBIB
\Bibitem{Pil15}
\by D.~V.~Pilshchikov
\paper A complexity analysis of algorithm of parallel search of the ``gold'' collision
\jour Mat. Vopr. Kriptogr.
\yr 2015
\vol 6
\issue 4
\pages 77--97
\mathnet{http://mi.mathnet.ru/mvk169}
\crossref{https://doi.org/10.4213/mvk169}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3550802}
\elib{https://elibrary.ru/item.asp?id=25688444}
Linking options:
  • https://www.mathnet.ru/eng/mvk169
  • https://doi.org/10.4213/mvk169
  • https://www.mathnet.ru/eng/mvk/v6/i4/p77
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:396
    Full-text PDF :202
    References:94
    First page:39
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024