Known plaintext attack is a scenario in which the attacker has access to pairs (P i , C i ), i = 1, …, N of known plaintexts and their corresponding ciphertexts. This attack is considered to be highly practical, especially if the amount of pairs N is not too large. This attack scenario is more practical than the chosen plaintext attack. Probable word method which is a popular technique for solving classical simple substitution or transposition ciphers is an example of a known-plaintext attack. Another example is the cryptanalysis of the German Enigma cipher (crypto machines or ) using the so-called bombs. It relied heavily on properly guessed opening words of the cryptograms (which were at the time called cribs). One of the most popular cribs was “Nothing to report.” In modern cryptography, linear cryptanalysis is a typical example of a known plaintext attack.
This is a preview of subscription content, access via your institution.
Tax calculation will be finalised at checkout
Purchases are for personal use onlyLearn about institutional subscriptions
Deavours CA Kruh L (1985) Machine cryptography and modern cryptanalysis. Artech House, Boston, MA
Editors and Affiliations
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Biryukov, A. (2011). Known Plaintext Attack. 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_588
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5