How to Protect DES Against Exhaustive Key Search

DOI10.1007/3-540-68697-5_20zbMath1329.94067OpenAlexW1801417685MaRDI QIDQ3452356

Joe Kilian, Phillip Rogaway

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_20

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (19)

Hidden shift quantum cryptanalysis and implications ⋮ Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE ⋮ Beyond quadratic speedups in quantum attacks on symmetric schemes ⋮ Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256 ⋮ Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem ⋮ Randomized half-ideal cipher on groups with applications to UC (a)PAKE ⋮ Post-quantum security on the Lai-Massey scheme ⋮ Side-Channel Analysis Protection and Low-Latency in Action ⋮ Provably secure reflection ciphers ⋮ Quantum attacks on Lai-Massey structure ⋮ Quantum key-length extension ⋮ Attacking Triple Encryption ⋮ Collision Resistant Double-Length Hashing ⋮ Reflection cryptanalysis of PRINCE-like ciphers ⋮ Building Secure Block Ciphers on Generic Attacks Assumptions ⋮ The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS ⋮ Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security ⋮ Pseudorandom Functions: Three Decades Later ⋮ Attacks on beyond-birthday-bound MACs in the quantum setting

This page was built for publication: How to Protect DES Against Exhaustive Key Search