Cycle detection using a stack
From MaRDI portal
Publication:2390239
DOI10.1016/J.IPL.2004.01.016zbMATH Open1178.68648DBLPjournals/ipl/Nivasch04OpenAlexW2088492907WikidataQ56388132 ScholiaQ56388132MaRDI QIDQ2390239FDOQ2390239
Authors: Gabriel Nivasch
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.01.016
Recommendations
Cites Work
- Title not available (Why is that?)
- Monte Carlo Methods for Index Computation (mod p)
- Title not available (Why is that?)
- A monte carlo method for factorization
- Parallel collision search with cryptanalytic applications
- An improved Monte Carlo factorization algorithm
- The Complexity of Finding Cycles in Periodic Functions
Cited In (21)
- Learning cycle length through finite automata
- Solving discrete logarithm problems faster with the aid of pre-computation
- Cycle detection algorithms and their applications
- Cryptanalysis of MD2
- An efficient collision detection method for computing discrete logarithms with Pollard's rho
- Optimal covering codes for finding near-collisions
- Time-memory trade-offs for near-collisions
- Quantum key search for ternary LWE
- Accelerating Pollard's rho algorithm on finite fields
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- Using random error correcting codes in near-collision attacks on generic hash-functions
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
- Title not available (Why is that?)
- Title not available (Why is that?)
- Slidex attacks on the Even-Mansour encryption scheme
- Improved lower bounds for the cycle detection problem
- Analysing the dynamics of digital chaotic maps via a new period search algorithm
- New second preimage attacks on dithered hash functions with low memory complexity
- Memory-Efficient Algorithms for Finding Needles in Haystacks
- Memoryless near-collisions via coding theory
- Speeding Up the Pollard Rho Method on Prime Fields
This page was built for publication: Cycle detection using a stack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390239)