Cycle detection using a stack

DOI10.1016/j.ipl.2004.01.016zbMath1178.68648OpenAlexW2088492907WikidataQ56388132 ScholiaQ56388132MaRDI QIDQ2390239

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

zbMATH Keywords

algorithmsanalysis of algorithmsstackrandom functiontime/memory tradeoffcycle detection

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Related Items (16)

Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions ⋮ Time-Memory Trade-Offs for Near-Collisions ⋮ An efficient collision detection method for computing discrete logarithms with Pollard's rho ⋮ New second preimage attacks on dithered hash functions with low memory complexity ⋮ Accelerating Pollard's rho algorithm on finite fields ⋮ New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru ⋮ Memoryless near-collisions via coding theory ⋮ Cryptanalysis of MD2 ⋮ Slidex attacks on the Even-Mansour encryption scheme ⋮ Speeding Up the Pollard Rho Method on Prime Fields ⋮ Analysing the dynamics of digital chaotic maps via a new period search algorithm ⋮ Optimal Covering Codes for Finding Near-Collisions ⋮ Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory ⋮ Memory-Efficient Algorithms for Finding Needles in Haystacks ⋮ Solving discrete logarithm problems faster with the aid of pre-computation ⋮ Quantum key search for ternary LWE

Cites Work

• Parallel collision search with cryptanalytic applications
• An improved Monte Carlo factorization algorithm
• The Complexity of Finding Cycles in Periodic Functions
• A monte carlo method for factorization
• Monte Carlo Methods for Index Computation (mod p)
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycle detection using a stack