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 BoundExtended meet-in-the-middle attacks on some Feistel constructionsImproved Information Set Decoding for Code-Based Cryptosystems with Constrained MemoryNew Attacks on Feistel Structures with Improved Memory ComplexitiesCryptanalysis of Full SproutTime-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary CodesMeet-in-the-middle preimage attacks on sponge-based hashingNew time-memory trade-offs for subset sum -- improving ISD in theory and practiceTriangulating rebound attack on AES-like hashingA New Algorithm for the Unbalanced Meet-in-the-Middle ProblemMind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256}A non-heuristic approach to time-space tradeoffs and optimizations for BKWUnnamed ItemImproved combinatorial algorithms for the inhomogeneous short integer solution problemMultidimensional meet-in-the-middle attack and its applications to KATAN32/48/64An algorithmic framework for the generalized birthday problemEfficient dissection of bicomposite problems with cryptanalytic applicationsFaster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related ProblemsImproved key recovery attacks on reduced-round AES with practical data and memory complexitiesКвантовые атаки на итерационные блочные шифрыThe retracing boomerang attackTight time-space lower bounds for finding multiple collision pairs and their applicationsThe rebound attack and subspace distinguishers: application to WhirlpoolOptimal 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