Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude

DOI10.1007/3-540-68697-5_18zbMath1329.94083OpenAlexW1756321105MaRDI QIDQ3452354

Michael J. Wiener, Paul C. van Oorschot

Publication date: 11 November 2015

Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-68697-5_18

zbMATH Keywords

DEScryptanalysismeet-in-the-middle attackparallel collision searchlow Hamming weight exponents

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials ⋮ On the cost of computing isogenies between supersingular elliptic curves ⋮ Memoryless near-collisions via coding theory ⋮ Cryptanalysis of TWOPRIME ⋮ Cryptanalytic Attacks on Pseudorandom Number Generators ⋮ Attacking Triple Encryption ⋮ Cryptanalysis of Some Recently-Proposed Multiple Modes of Operation ⋮ Анализ сложности алгоритма параллельного поиска “золотой” коллизии ⋮ Efficient dissection of bicomposite problems with cryptanalytic applications

Cites Work

• Time-memory-processor trade-offs
• A cryptanalytic time-memory trade-off
• A monte carlo method for factorization
• Monte Carlo Methods for Index Computation (mod p)
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude