Cycle detection algorithms and their applications
From MaRDI portal
Publication:690565
DOI10.1007/s10958-012-0755-xzbMath1274.68140OpenAlexW2001399305MaRDI QIDQ690565
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
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel collision search with cryptanalytic applications
- On random walks for Pollard's rho method
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
- An improved Monte Carlo factorization algorithm
- The Complexity of Finding Cycles in Periodic Functions
- A monte carlo method for factorization
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
This page was built for publication: Cycle detection algorithms and their applications