Exhaustive Key Search of the DES: Updates and Refinements
(2005) Proceedings of SHARCS 2005, Special-purpose Hardware for Attacking Cryptographic Systems — Location: Paris/France
Files
28.pdf
Open Access - Adobe PDF
- 151.64 KB
Details
- Authors
- Abstract
- Exhaustive key search is the simplest attack against a cryptosystem, but it is sometimes the most realistic. This is specially true for carefully designed block ciphers for which advanced cryptanalysis (e.g. : linear, differential) is not applicable. In this paper, we dirst update the cost of an exhaustive key search of the Data Encryption Standard (DES) using Field Programmable Gate Arrays (FPGAs). Then we illus- trate how a time-memory tradeoff attack can be mounted for a similar cost, with much more dramatic consequences.
- Affiliations
Citations
Quisquater, J.-J., & Standaert, F.-X. (2005). Exhaustive Key Search of the DES: Updates and Refinements. Proceedings of SHARCS 2005, Special-purpose Hardware for Attacking Cryptographic Systems, Paris/France. https://hdl.handle.net/2078.5/220849