Efficient dissection of bicomposite problems with cryptanalytic applications
From MaRDI portal
Publication:2010595
DOI10.1007/S00145-018-9303-2zbMATH Open1435.94127OpenAlexW2888583758MaRDI QIDQ2010595FDOQ2010595
Authors: Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir 
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
Recommendations
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- From multiple encryption to knapsacks -- efficient dissection of composite problems
- An algorithmic framework for the generalized birthday problem
- A cryptanalytic time-memory trade-off
- Time-memory-processor trade-offs
cryptanalysisknapsack problemsmultiple encryptiontime-memory tradeoffbicomposite problemsdissection algorithm
Cites Work
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Keying hash functions for message authentication
- Improved Generic Algorithms for Hard Knapsacks
- The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
- A cryptanalytic time-memory trade-off
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Saving space by algebraization
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- A single-key attack on the full GOST block cipher
- Improved Attacks on Full GOST
- How to improve rebound attacks
- Improving implementable meet-in-the-middle attacks by orders of magnitude
- New generic algorithms for hard knapsacks
- Improved key recovery attacks on reduced-round AES with practical data and memory complexities
- The rebound attack and subspace distinguishers: application to Whirlpool
- Sieve-in-the-middle: improved MITM attacks
- Attacking triple encryption
- Cryptanalysis of full sprout
- Cryptanalysis of triple modes of operation
- Space-efficient randomized algorithms for \(k\)-sum
- New attacks on Feistel structures with improved memory complexities
- On the power of cascade ciphers
- Space-time tradeoffs for subset sum: an improved worst case algorithm
Cited In (6)
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- An algorithmic framework for the generalized birthday problem
- Optimum attack on 3-round Feistel-2 structure
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- Quantum Key Recovery Attacks on 3-Round Feistel-2 Structure Without Quantum Encryption Oracles
- From multiple encryption to knapsacks -- efficient dissection of composite problems
This page was built for publication: Efficient dissection of bicomposite problems with cryptanalytic applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010595)
