Pages that link to "Item:Q2914297"

The following pages link to Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems (Q2914297):

Displaying 19 items.

• Multidimensional meet-in-the-middle attack and its applications to KATAN32/48/64 (Q458737) (← links)
• Improved combinatorial algorithms for the inhomogeneous short integer solution problem (Q1715853) (← links)
• An algorithmic framework for the generalized birthday problem (Q1999907) (← links)
• Efficient dissection of bicomposite problems with cryptanalytic applications (Q2010595) (← links)
• The retracing boomerang attack (Q2055612) (← links)
• Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
• Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
• The rebound attack and subspace distinguishers: application to Whirlpool (Q2344049) (← links)
• Extended meet-in-the-middle attacks on some Feistel constructions (Q2630716) (← links)
• A New Algorithm for the Unbalanced Meet-in-the-Middle Problem (Q2958141) (← links)
• Квантовые атаки на итерационные блочные шифры (Q3381825) (← links)
• Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
• New Attacks on Feistel Structures with Improved Memory Complexities (Q3457122) (← links)
• Cryptanalysis of Full Sprout (Q3457133) (← links)
• Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
• (Q5009597) (← links)
• The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound (Q5041235) (← links)
• Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes (Q5087252) (← links)
• Improved key recovery attacks on reduced-round AES with practical data and memory complexities (Q5918865) (← links)