Cycle detection algorithms and their applications
DOI10.1007/S10958-012-0755-XzbMATH Open1274.68140OpenAlexW2001399305MaRDI QIDQ690565FDOQ690565
Authors: A. Yu. Nesterenko
Publication date: 28 November 2012
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-012-0755-x
Recommendations
Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- A monte carlo method for factorization
- Title not available (Why is that?)
- Parallel collision search with cryptanalytic applications
- Title not available (Why is that?)
- On random walks for Pollard's rho method
- An improved Monte Carlo factorization algorithm
- The Complexity of Finding Cycles in Periodic Functions
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
Cited In (7)
This page was built for publication: Cycle detection algorithms and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690565)