Efficient dissection of bicomposite problems with cryptanalytic applications
From MaRDI portal
Publication:2010595
DOI10.1007/s00145-018-9303-2zbMath1435.94127OpenAlexW2888583758MaRDI QIDQ2010595
Adi Shamir, Orr Dunkelman, Nathan Keller, Itai Dinur
Publication date: 27 November 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-018-9303-2
cryptanalysisknapsack problemsmultiple encryptiontime-memory tradeoffbicomposite problemsdissection algorithm
Related Items (2)
Optimum attack on 3-round Feistel-2 structure ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
Cites Work
- Unnamed Item
- Cryptanalysis of triple modes of operation
- The rebound attack and subspace distinguishers: application to Whirlpool
- Sieve-in-the-Middle: Improved MITM Attacks
- Saving space by algebraization
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- Space-Efficient Randomized Algorithms for K-SUM
- Improved Generic Algorithms for Hard Knapsacks
- A Single-Key Attack on the Full GOST Block Cipher
- The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
- Keying Hash Functions for Message Authentication
- Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
- New Attacks on Feistel Structures with Improved Memory Complexities
- Cryptanalysis of Full Sprout
- New Generic Algorithms for Hard Knapsacks
- A cryptanalytic time-memory trade-off
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Attacking Triple Encryption
- Improved Attacks on Full GOST
- On the Power of Cascade Ciphers
- How to Improve Rebound Attacks
- Advances in Cryptology – CRYPTO 2004
- Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm
- Improved key recovery attacks on reduced-round AES with practical data and memory complexities
This page was built for publication: Efficient dissection of bicomposite problems with cryptanalytic applications
