The Complexity of Finding Cycles in Periodic Functions
From MaRDI portal
Publication:3936192
DOI10.1137/0211030zbMath0478.68040OpenAlexW2025203646WikidataQ56388135 ScholiaQ56388135MaRDI QIDQ3936192
Robert Sedgewick, Andrew Chi-Chih Yao, Thomas G. Szymanski
Publication date: 1982
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0211030
Analysis of algorithms and problem complexity (68Q25) Random number generation in numerical analysis (65C10)
Related Items (17)
Prediction of infinite words with automata ⋮ Cycle detection using a stack ⋮ Is the data encryption standard a group? (Results of cycling experiments on DES) ⋮ Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions ⋮ Time-Memory Trade-Offs for Near-Collisions ⋮ Accelerating Pollard's rho algorithm on finite fields ⋮ The Hash Function Family LAKE ⋮ On random walks for Pollard's rho method ⋮ Cycle detection algorithms and their applications ⋮ Speeding Up the Pollard Rho Method on Prime Fields ⋮ Improved classical cryptanalysis of SIKE in practice ⋮ Preimage Attacks on 3-Pass HAVAL and Step-Reduced MD5 ⋮ Solving discrete logarithm problems faster with the aid of pre-computation ⋮ DYNAMICAL CHARACTERISTICS OF DISCRETIZED CHAOTIC PERMUTATIONS ⋮ Lower bounds for the cycle detection problem ⋮ Faster Multicollisions ⋮ Improved lower bounds for the cycle detection problem
This page was built for publication: The Complexity of Finding Cycles in Periodic Functions
