A New Algorithm for the Unbalanced Meet-in-the-Middle Problem
From MaRDI portal
Publication:2958141
DOI10.1007/978-3-662-53887-6_23zbMath1404.94102OpenAlexW2552714397MaRDI QIDQ2958141
Publication date: 1 February 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53887-6_23
Related Items
Uses Software
Cites Work
- Unnamed Item
- Parallel collision search with cryptanalytic applications
- Tradeoff Cryptanalysis of Memory-Hard Functions
- Refinements of the k-tree Algorithm for the Generalized Birthday Problem
- Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers
- Limited-Birthday Distinguishers for Hash Functions
- Minimalism in Cryptography: The Even-Mansour Scheme Revisited
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE
- Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
- Rebound Attack on the Full Lane Compression Function
- Improved Generic Algorithms for 3-Collisions
- A cryptanalytic time-memory trade-off
- McOE: A Family of Almost Foolproof On-Line Authenticated Encryption Schemes
- Memoryless Unbalanced Meet-in-the-Middle Attacks: Impossible Results and Applications
- How to Improve Rebound Attacks
- Nondeterministic Algorithms
