Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
From MaRDI portal
Publication:2914297
DOI10.1007/978-3-642-32009-5_42zbMath1294.94042OpenAlexW2252401345MaRDI QIDQ2914297
Nathan Keller, Adi Shamir, Orr Dunkelman, Itai Dinur
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_42
Related Items (24)
The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound ⋮ Extended meet-in-the-middle attacks on some Feistel constructions ⋮ Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory ⋮ New Attacks on Feistel Structures with Improved Memory Complexities ⋮ Cryptanalysis of Full Sprout ⋮ Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes ⋮ Meet-in-the-middle preimage attacks on sponge-based hashing ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ Triangulating rebound attack on AES-like hashing ⋮ A New Algorithm for the Unbalanced Meet-in-the-Middle Problem ⋮ Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256} ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ Unnamed Item ⋮ Improved combinatorial algorithms for the inhomogeneous short integer solution problem ⋮ Multidimensional meet-in-the-middle attack and its applications to KATAN32/48/64 ⋮ An algorithmic framework for the generalized birthday problem ⋮ Efficient dissection of bicomposite problems with cryptanalytic applications ⋮ Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems ⋮ Improved key recovery attacks on reduced-round AES with practical data and memory complexities ⋮ Квантовые атаки на итерационные блочные шифры ⋮ The retracing boomerang attack ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ The rebound attack and subspace distinguishers: application to Whirlpool ⋮ Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
This page was built for publication: Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems