Memory-Efficient Algorithms for Finding Needles in Haystacks
From MaRDI portal
Publication:2829215
DOI10.1007/978-3-662-53008-5_7zbMATH Open1372.94423OpenAlexW2505749226MaRDI QIDQ2829215FDOQ2829215
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
Cites Work
- Title not available (Why is that?)
- Herding Hash Functions and the Nostradamus Attack
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Parallel collision search with cryptanalytic applications
- Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
- Improved Generic Algorithms for 3-Collisions
- A cryptanalytic time-memory trade-off
- Advances in Cryptology - EUROCRYPT 2004
- Cycle detection using a stack
- An improved Monte Carlo factorization algorithm
Cited In (6)
- Finding low-weight polynomial multiples using the rho method
- Memory-efficient attacks on small LWE keys
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- Efficient detection of high probability statistical properties of cryptosystems via surrogate differentiation
- Improving generic attacks using exceptional functions
- Memory-efficient attacks on small LWE keys
Recommendations
- Title not available (Why is that?) 👍 👎
- Memory efficient and high-speed search Huffman coding 👍 👎
- Space Efficient Data Structures for Nearest Larger Neighbor 👍 👎
- Sorting and searching in the presence of memory faults (without redundancy) 👍 👎
- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers 👍 👎
- Efficient search algorithm on compact S-trees 👍 👎
- A polynomial-time algorithm for memory space reduction 👍 👎
- Space efficient algorithms for breadth-depth search 👍 👎
- SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS 👍 👎
- Memory management for Union-Find algorithms 👍 👎
This page was built for publication: Memory-Efficient Algorithms for Finding Needles in Haystacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829215)
