An algorithmic framework for the generalized birthday problem
From MaRDI portal
Publication:1999907
DOI10.1007/s10623-018-00594-6zbMath1409.94868OpenAlexW2899970174WikidataQ122687145 ScholiaQ122687145MaRDI QIDQ1999907
Publication date: 27 June 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-018-00594-6
Related Items (4)
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- The extended \(k\)-tree algorithm
- Fast correlation attacks on certain stream ciphers
- Parallel collision search with cryptanalytic applications
- Refinements of the k-tree Algorithm for the Generalized Birthday Problem
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- Improved Generic Algorithms for Hard Knapsacks
- New Generic Algorithms for Hard Knapsacks
- Security Bounds for the Design of Code-Based Cryptosystems
- FSBday
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
This page was built for publication: An algorithmic framework for the generalized birthday problem
