Definition
For any given key k, a block cipher specifies an encryption algorithm for computing the n-bit ciphertext for a given n-bit plaintext, together with a decryption algorithm for computing the n-bit plaintext corresponding to a given n-bit ciphertext.
Background
Encryption systems have existed for thousands of years; many of the older systems may be characterized as block ciphers. Block ciphers became popular with the publication of the Data Encryption Standard in 1977.
Theory
In his milestone paper from 1949 [15] Shannon defines perfect secrecy for secret-key systems and shows that they exist. A secret-key cipher obtains perfect secrecy if for all plaintexts x and all ciphertexts y it holds that Pr(x) = Pr(x | y) [15]. In other words, a ciphertext y gives no information about the plaintext. This definition leads to the following result.
Corollary 1
A cipher with perfect secrecy is unconditionally secure against an adversary who, a priori, knows only the ciphertext.
As noted by...
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
Biham E, Shamir A (1993) Differential cryptanalysis of the data encryption standard. Springer, Berlin
Biryukov A, Wagner D (1999) Slide attacks. In: Knudsen LR (ed) Fast software encryption, sixth international workshop, Rome, March 1999. Lecture notes in computer science, vol 1636. Springer, Berlin, pp 245–259
Daemen J, Knudsen L, Rijmen V (1997) The block cipher Square. In: Biham E (ed) Fast software encryption, fourth international workshop, Haifa, January 1997. Lecture notes in computer science, vol 1267. Springer, Berlin, pp 149–165
Hellman M (1980) A cryptanalytic time-memory trade-off. IEEE Trans Inform Theory IT-26(4):401–406
Hellman ME, Langford SK (1994) Differential–linear cryptanalysis. In: Desmedt Y (ed) Advances in cryptology: CRYPTO’94, Lecture notes in computer science, vol 839. Springer, Berlin, pp 26–39
Kilian J, Rogaway P (2001) How to protect DES against exhaustive key search (an analysis of DESX). J Cryptol 14(1):17–35
Knudsen LR (1995) Truncated and higher order differentials. In: Preneel B (ed) Fast software encryption – second international workshop, Leuven. Lecture notes in computer science, vol 1008. Springer, Berlin, pp 196–211
Knudsen LR (1999) Contemporary block ciphers. In: Damgård I (ed) Lectures on data security, modern cryptology in theory and practice, Summer School, Aarhus, July 1998. Lecture notes in computer science, vol 1561. Springer, Berlin, pp 105–126
Lai X (1994) Higher order derivatives and differential cryptanalysis. In: Blahut R (ed) Communication and cryptography, two sides of one tapestry. Kluwer, Dordrecht. ISBN 0-7923-9469-0
Lai X, Massey JL, Murphy S (1992) Markov ciphers and differential cryptanalysis. In: Davies DW (ed) Advances in cryptology – EUROCRYPT’91, Lecture notes in computer science, vol 547. Springer, Berlin, pp 17–38
Matsui M (1993) Linear cryptanalysis method for DES cipher. In: Helleseth T (ed) Advances in cryptology – EUROCRYPT’93, Lecture notes in computer science, vol 765. Springer, Berlin, pp 386–397
Matsui M (1994) The first experimental cryptanalysis of the data encryption standard. In: Desmedt YG (ed) Advances in cryptology – CRYPTO’94, Lecture notes in computer science, vol 839. Springer, Berlin, pp 1–11
National Bureau of Standards (1977) Data encryption standard. Federal Information Processing Standard (FIPS), Publication 46, National Bureau of Standards, U.S. Department of Commerce, Washington, DC
NIST (2001) Advanced encryption standard. FIPSÂ 197, US Department of Commerce, Washington, DC
Shannon CE (1949) Communication theory of secrecy systems. Bell Syst Technol J 28:656–715
Tuchman W (1979) Hellman presents no shortcut solutions to DES. IEEE Spectr 16(7):40–41
van Oorschot PC, Wiener MJ (1999) Parallel collision search with cryptanalytic applications. J Cryptol 12(1):1–28
Vaudenay S (1995) An experiment on DES – statistical cryptanalysis. In: Proceedings of the 3rd ACM conferences on computer security, New Delhi. ACM Press, New York, pp 139–147
Vaudenay S (2003) Decorrelation: a theory for block cipher security. J Cryptol 16(4):249–286
Wagner D (1999) The boomerang attack. In: Knudsen LR (ed) Fast software encryption, sixth international workshop, Rome, March 1999, Lecture notes in computer science, vol 1636. Springer, Berlin, pp 156–170
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
Knudsen, L.R. (2011). Block Ciphers. 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_549
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_549
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