Related Concepts
Introduction
The simplest approach to cryptanalyzing a block cipher is exhaustive key search. The cryptanalyst wishes to find the key k that was used with block cipher E to encrypt some plaintext P to produce ciphertext C, C = E k (P) (Fig. 1 and Shannon’s model).
Block cipher encryption
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Daemen J, Rijmen V (2002) The design of Rijndael: AES— the advanced encryption standard. Springer, Berlin
Diffie W, Hellman M (1977) Exhaustive cryptanalysis of the NBS data encryption standard. Computer 10(6):74–84
Electronic Frontier Foundation (1998) Cracking DES: secrets of encryption research, wiretap politics, and chip design. O’Reilly and Associates, Sebastopol, CA
FIPS 46 (1977) Data encryption standard. Federal information processing standards publication 46. U.S. Department of Commerce/National Bureau of Standards, National Technical Information Service, Springfield, VA (revised as FIPS 46-1 in 1988, FIPS 46-2 in 1993)
FIPS 81 (1980) DES modes of operation. Federal information processing standards publication 81. U.S. Department of Commerce/National Bureau of Standards, National Technical Information Service, Springfield, VA
FIPS 197 (2001) Advanced encryption standard (AES). Federal information processing standards publication 197. U.S. National Institute of Standards and Technology (NIST). Available on http://csrc.nist.gov/CryptoToolkit/aes/
Pollard JM (1978) Monte Carlo methods for index computation (mod p). Math Comput 32(143):918–924
Rivest RL (1997) All-or-nothing encryption and the package transform. In: Biham E (ed) Fast software encryption’97, 4th international workshop. Lecture notes in computer science, vol 1267. Springer, Berlin, pp 210–218
van Oorschot PC, Wiener MJ (1999) Parallel collision search with cryptanalytic applications. J Cryptol 12(1):1–28
Wiener MJ (1996) Efficient DES key search. In: The rump session of CRYPTO’93, Lecture notes in computer science. Springer, Berlin. (Reprinted in Stallings W (ed) Practical cryptography for data internetworks, IEEE Computer Society Press, pp 31–79)
Wiener MJ (2004) The full cost of cryptanalytic attacks. J Cryptol 17(2):105–124
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Wiener, M. (2011). Exhaustive Key Search. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_575
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_575
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering