Cycle detection using a stack

DOI10.1016/J.IPL.2004.01.016MaRDI QIDQ2390239zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

algorithmsanalysis of algorithmsstackrandom functiontime/memory tradeoffcycle detection

Mathematics Subject Classification ID

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

Recommendations

• Cycle detection algorithms and their applications
• scientific article; zbMATH DE number 4074447
• scientific article; zbMATH DE number 729934
• Improved lower bounds for the cycle detection problem
• scientific article; zbMATH DE number 1705167

Cites work

• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A monte carlo method for factorization
• An improved Monte Carlo factorization algorithm
• Monte Carlo Methods for Index Computation (mod p)
• Parallel collision search with cryptanalytic applications
• The Complexity of Finding Cycles in Periodic Functions

Cited in

(21)

• Improved lower bounds for the cycle detection problem
• scientific article; zbMATH DE number 4074447 (Why is no real title available?)
• scientific article; zbMATH DE number 729934 (Why is no real title available?)
• Slidex attacks on the Even-Mansour encryption scheme
• Speeding Up the Pollard Rho Method on Prime Fields
• Accelerating Pollard's rho algorithm on finite fields
• Time-memory trade-offs for near-collisions
• Quantum key search for ternary LWE
• New second preimage attacks on dithered hash functions with low memory complexity
• Learning cycle length through finite automata
• Memory-Efficient Algorithms for Finding Needles in Haystacks
• New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• Solving discrete logarithm problems faster with the aid of pre-computation
• An efficient collision detection method for computing discrete logarithms with Pollard's rho
• Using random error correcting codes in near-collision attacks on generic hash-functions
• Cycle detection algorithms and their applications
• Analysing the dynamics of digital chaotic maps via a new period search algorithm
• Optimal covering codes for finding near-collisions
• Memoryless near-collisions via coding theory
• Cryptanalysis of MD2

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)