Cycle detection using a stack
From MaRDI portal
Publication:2390239
DOI10.1016/j.ipl.2004.01.016zbMath1178.68648WikidataQ56388132 ScholiaQ56388132MaRDI QIDQ2390239
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
Related Items
An efficient collision detection method for computing discrete logarithms with Pollard's rho, Accelerating Pollard's rho algorithm on finite fields, Memoryless near-collisions via coding theory, New second preimage attacks on dithered hash functions with low memory complexity, Slidex attacks on the Even-Mansour encryption scheme, Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory, Quantum key search for ternary LWE, Cryptanalysis of MD2, Analysing the dynamics of digital chaotic maps via a new period search algorithm, Solving discrete logarithm problems faster with the aid of pre-computation, Memory-Efficient Algorithms for Finding Needles in Haystacks, Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions, Time-Memory Trade-Offs for Near-Collisions, Optimal Covering Codes for Finding Near-Collisions, New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru, Speeding Up the Pollard Rho Method on Prime Fields
Cites Work
