Memory-Efficient Algorithms for Finding Needles in Haystacks

DOI10.1007/978-3-662-53008-5_7zbMath1372.94423OpenAlexW2505749226MaRDI QIDQ2829215

Nathan Keller, Orr Dunkelman, Adi Shamir, Itai Dinur

Publication date: 27 October 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_7

zbMATH Keywords

cryptanalysismode detectionparallel collision searchneedles in haystacksrho algorithms

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Efficient detection of high probability statistical properties of cryptosystems via surrogate differentiation ⋮ Finding low-weight polynomial multiples using the rho method ⋮ Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory

Cites Work

• Unnamed Item
• Parallel collision search with cryptanalytic applications
• Cycle detection using a stack
• Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
• Herding Hash Functions and the Nostradamus Attack
• Improved Generic Algorithms for 3-Collisions
• A cryptanalytic time-memory trade-off
• An improved Monte Carlo factorization algorithm
• Advances in Cryptology - EUROCRYPT 2004
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work

This page was built for publication: Memory-Efficient Algorithms for Finding Needles in Haystacks