Abstract
In Chapter 3, we defined cryptosystems and described some historical examples. All of the cryptosystems in Chapter 3 could be broken because they are affine linear. A cryptosystem with perfect secrecy, the Vernam one-time pad, was presented in Chapter 4, but it turned out to be very inefficient. In this chapter, we describe the Data Encryption Standard (DES). For many years, this cryptosystem was the encryption standard in the U.S. and was used worldwide. Today, DES is no longer secure. In October 2000 the US Secretary of Commerce announced the nation’s proposed new Advanced Enryption Standard. He named the Rijndael data encryption formula as the winner of a three-year competition (see [28]). Nevertheless, there are secure variants of DES (see Section 3.7), and most of the suggested successors to DES are similar to DES. Therefore, DES is still an important cryptosystem and we describe it here.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Buchmann, J.A. (2001). DES. In: Introduction to Cryptography. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-0496-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4684-0496-8_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-0498-2
Online ISBN: 978-1-4684-0496-8
eBook Packages: Springer Book Archive