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], 2017, Volume 8, Issue 1, Pages 95–106
DOI: https://doi.org/10.4213/mvk217 (Mi mvk217) 		 
This article is cited in 7 scientific papers (total in 7 papers)

Asymptotic behaviour of the complete preimage cardinality for the image of a random set under iterations of mappings of a finite set

D. V. Pilshchikov

TVP Laboratories, Moscow
Full-text PDF (178 kB) Citations (7)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk217
Abstract: The estimation of complexity of time-memory-data tradeoff algorithms leads to the estimation problems of the complete preimage cardinality for the image of a random set under multiple iterations of mappings. We describe a probabilistic model allowing to estimate the cardinalities of the random sets considered via the number of particles and the total number of particles in the Galton–Watson process. The limits of mean values of these random variables are found.
Key words: image of a random set, preimage cardinality, Hellman method, timememory tradeoff with distiguished points.
Received 30.V.2016
Bibliographic databases:
Document Type: Article
UDC: 519.719.2+519.712
Language: Russian
Citation: D. V. Pilshchikov, “Asymptotic behaviour of the complete preimage cardinality for the image of a random set under iterations of mappings of a finite set”, Mat. Vopr. Kriptogr., 8:1 (2017), 95–106
Citation in format AMSBIB
\Bibitem{Pil17}
\by D.~V.~Pilshchikov
\paper Asymptotic behaviour of the complete preimage cardinality for the image of a random set under iterations of mappings of a finite set
\jour Mat. Vopr. Kriptogr.
\yr 2017
\vol 8
\issue 1
\pages 95--106
\mathnet{http://mi.mathnet.ru/mvk217}
\crossref{https://doi.org/10.4213/mvk217}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3682441}
\elib{https://elibrary.ru/item.asp?id=29864942}
Linking options:
  • https://www.mathnet.ru/eng/mvk217
  • https://doi.org/10.4213/mvk217
  • https://www.mathnet.ru/eng/mvk/v8/i1/p95
    • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:347
    Full-text PDF :173
    References:57
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024