Skip to main content

The Machines Take Over: Computer Cryptography

  • Chapter
  • First Online:
History of Cryptography and Cryptanalysis

Part of the book series: History of Computing ((HC))

  • 2917 Accesses

Abstract

Modern cryptology rests on the shoulders of three men of rare talents. William Friedman, Lester Hill and Claude Shannon moved cryptology from an esoteric, mystical, strictly linguistic realm into the world of mathematics and statistics. Once Friedman, Hill, and Shannon placed cryptology on firm mathematical ground, other mathematicians and computer scientists developed the new algorithms to do digital encryption in the computer age. Despite some controversial flaws, the U.S. Federal Data Encryption Standard (DES ) was the most widely used computer encryption algorithm in the twentieth century. In 2001 a much stronger algorithm, the Advanced Encryption Standard (AES ) that was vetted by a new burgeoning public cryptologic community, replaced it. This chapter introduces Hill and Shannon and explores the details of the DES and the AES.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 44.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.eff.org/

  2. 2.

    Moore’s law, named after Intel founder Gordon Moore, says that that every year or two the number of transistors on an integrated circuit will double, increasing the speed and power of the processor, and the price will remain the same or drop. This law held true for more than 30 years, but limits on transistor size and heat problems (if you speed up the processor it generates more heat which must be dissipated) caused the laws effects to slow down by the early 2010s. This is why all modern computers have more than one core (CPU) in them. They are trying to mitigate the need to slow down the processor (to dissipate heat) by adding parallelism.

  3. 3.

    https://www.nist.gov/publications/secure-hash-standard

  4. 4.

    https://en.wikipedia.org/wiki/SHA-2

  5. 5.

    https://en.wikipedia.org/wiki/SHA-3

  6. 6.

    https://en.wikipedia.org/wiki/MD5

  7. 7.

    https://en.wikipedia.org/wiki/Blowfish_(cipher)

  8. 8.

    https://en.wikipedia.org/wiki/Bcrypt

  9. 9.

    https://www.schneier.com/academic/blowfish/

  10. 10.

    https://en.wikipedia.org/wiki/FBI%E2%80%93Apple_encryption_dispute

  11. 11.

    https://13639-presscdn-0-80-pagely.netdna-ssl.com/wp-content/uploads/2017/12/Top-100-Worst-Passwords-of-2017a.pdf

References

  • Bauer, Craig P. 2013. Secret History: The Story of Cryptology. Boca Raton: CRC Press.

    MATH  Google Scholar 

  • Daemen, Joan, and Vincent Rijmen. 2002. The Design of Rijndael: AES – The Advanced Encryption Standard. New York: Springer-Verlag.

    Book  Google Scholar 

  • Diffie, Whitfield, and Martin Hellman. 1977. Exhaustive Cryptanalysis of the NBS Data Encryption Standard. IEEE Computer 10 (6): 74–84.

    Article  Google Scholar 

  • Electronic Frontier Foundation. 1998. Cracking DES: Secrets of Encryption Research, Wiretap Politics, and Chip Design. Sebastopol: O’Reilly and Associates, Inc. https://www.eff.org/.

  • Feistel, Horst. 1973. Cryptography and Computer Privacy. Scientific American 228 (5): 15–23.

    Article  Google Scholar 

  • Hill, Lester S. 1929. Cryptography in an Algebraic Alphabet. The American Mathematical Monthly 36 (July): 306–312.

    Article  Google Scholar 

  • ———. 1931. Concerning Certain Linear Transformation Apparatus of Cryptography. The American Mathematical Monthly 38: 135–154.

    Article  MathSciNet  Google Scholar 

  • Kahn, David. 1967. The Codebreakers; The Story of Secret Writing. New York: Macmillan.

    Google Scholar 

  • Morris, R., N.J.A. Sloane, and A.D. Wyner. 1977. Assessment of the National Bureau of Standards Proposed Federal Data Encryption Standard. Cryptologia 1 (3): 281–291.

    Article  Google Scholar 

  • NIST. 1999. Data Encryption Standard (DES) FIPS 46-3. Gaithersburg: United States Department of Commerce.

    Google Scholar 

  • ———. 2001. Federal Information Processing Standard 197: Advanced Encryption Standard (AES). FIPS-197. Gaithersburg: United States Department of Commerce.

    Google Scholar 

  • Shannon, Claude. 1948. A Mathematical Theory of Communication, Parts I and II. Bell System Technical Journal 27 (October): 379–423 623–56.

    Article  MathSciNet  Google Scholar 

  • ———. 1949. Communication Theory of Secrecy Systems. Bell System Technical Journal 28 (4): 656–715.

    Article  MathSciNet  Google Scholar 

  • Stallings, William. 2011. Cryptography and Network Security: Principles and Practice, 5th ed. Upper Saddle River: Prentice Hall. https://www.williamstallings.com.

  • Stallings, William, and Lawrie Brown. 2015. Computer Security: Principles and Practice, 3rd ed. Boston: Pearson Education. http://www.williamstallings.com/ComputerSecurity.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Dooley, J.F. (2018). The Machines Take Over: Computer Cryptography. In: History of Cryptography and Cryptanalysis. History of Computing. Springer, Cham. https://doi.org/10.1007/978-3-319-90443-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-90443-6_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-90442-9

  • Online ISBN: 978-3-319-90443-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics