Memory-Efficient Algorithms for Finding Needles in Haystacks
From MaRDI portal
Publication:2829215
Recommendations
- scientific article; zbMATH DE number 1808207
- Memory management for union-find algorithms
- Space efficient algorithms for breadth-depth search
- Memory efficient and high-speed search Huffman coding
- Sorting and searching in the presence of memory faults (without redundancy)
- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
- SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS
- Efficient search algorithm on compact S-trees
- A polynomial-time algorithm for memory space reduction
- Space efficient data structures for nearest larger neighbor
Cites work
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- A cryptanalytic time-memory trade-off
- Advances in Cryptology - EUROCRYPT 2004
- An improved Monte Carlo factorization algorithm
- Cycle detection using a stack
- Herding Hash Functions and the Nostradamus Attack
- Improved Generic Algorithms for 3-Collisions
- Parallel collision search with cryptanalytic applications
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
Cited in
(6)- Finding low-weight polynomial multiples using the rho method
- Improving generic attacks using exceptional functions
- Memory-efficient attacks on small LWE keys
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- Memory-efficient attacks on small LWE keys
- Efficient detection of high probability statistical properties of cryptosystems via surrogate differentiation
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)
