The following pages link to Cycle detection using a stack (Q2390239):
Displaying 16 items.
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
- Memoryless near-collisions via coding theory (Q663464) (← links)
- New second preimage attacks on dithered hash functions with low memory complexity (Q1698640) (← links)
- Slidex attacks on the Even-Mansour encryption scheme (Q2018815) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- Quantum key search for ternary LWE (Q2118530) (← links)
- Cryptanalysis of MD2 (Q2267363) (← links)
- Analysing the dynamics of digital chaotic maps via a new period search algorithm (Q2296984) (← links)
- Solving discrete logarithm problems faster with the aid of pre-computation (Q2322875) (← links)
- Memory-Efficient Algorithms for Finding Needles in Haystacks (Q2829215) (← links)
- Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions (Q2945385) (← links)
- Time-Memory Trade-Offs for Near-Collisions (Q2946879) (← links)
- Optimal Covering Codes for Finding Near-Collisions (Q3084254) (← links)
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru (Q3525694) (← links)
- Speeding Up the Pollard Rho Method on Prime Fields (Q3600392) (← links)
