Skip to main content

Safety in Numbers: Modern Cryptography from Ancient Arithmetic

  • Chapter
What Is Computer Science?

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

  • 3284 Accesses

Abstract

This chapter shifts the focus on cryptography from historical ciphers to their present day replacements. The content is split into two parts. First, the fundamentals of number theory (a branch of pure Mathematics) is introduced; the main topic is that of modular arithmetic, including a range of simple algorithms used to compute results. Using this starting point, it then describes two modern cryptographic schemes (the RSA encryption, and Diffie-Hellman key exchange schemes) that more or less all of us rely on every day. For example, both form components within the Secure Sockets Layer (SSL) which supports secure web-browsing.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Wikipedia: Alice and Bob. http://en.wikipedia.org/wiki/Alice_and_Bob

  2. Wikipedia: Block cipher. http://en.wikipedia.org/wiki/Block_cipher

  3. Wikipedia: Block cipher modes of operation. http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation

  4. Wikipedia: Coprime. http://en.wikipedia.org/wiki/Coprime

  5. Wikipedia: Diffie-Hellman. http://en.wikipedia.org/wiki/Diffie-Hellman

  6. Wikipedia: Discrete logarithm. http://en.wikipedia.org/wiki/Discrete_logarithm

  7. Wikipedia: ElGamal encryption. http://en.wikipedia.org/wiki/ElGamal_encryption

  8. Wikipedia: Euclidean algorithm. http://en.wikipedia.org/wiki/Euclidean_algorithm

  9. Wikipedia: Euler’s totient function. http://en.wikipedia.org/wiki/Euler’s_totient_function

  10. Wikipedia: Exponentiation by squaring. http://en.wikipedia.org/wiki/Exponentiation_by_squaring

  11. Wikipedia: Extended Euclidean algorithm. http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm

  12. Wikipedia: GCHQ. http://en.wikipedia.org/wiki/Government_Communications_Headquarters

  13. Wikipedia: Identity function. http://en.wikipedia.org/wiki/Identity_function

  14. Wikipedia: Integer. http://en.wikipedia.org/wiki/Integer

  15. Wikipedia: Key agreement protocol. http://en.wikipedia.org/wiki/Key-agreement_protocol

  16. Wikipedia: Man-in-the-middle attack. http://en.wikipedia.org/wiki/Man-in-the-middle_attack

  17. Wikipedia: Number theory. http://en.wikipedia.org/wiki/Number_theory

  18. Wikipedia: One-way function. http://en.wikipedia.org/wiki/One-way_function

  19. Wikipedia: Prime factor. http://en.wikipedia.org/wiki/Prime_factor

  20. Wikipedia: Prime number. http://en.wikipedia.org/wiki/Prime_number

  21. Wikipedia: Public key cryptography. http://en.wikipedia.org/wiki/Public-key_cryptography

  22. Wikipedia: RSA. http://en.wikipedia.org/wiki/RSA

  23. Wikipedia: RSA Problem. http://en.wikipedia.org/wiki/RSA_problem

  24. Wikipedia: Symmetric key cryptography. http://en.wikipedia.org/wiki/Symmetric_key_algorithm

  25. Wikipedia: Transport Layer Security (TLS). http://en.wikipedia.org/wiki/Transport_Layer_Security

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Page, D., Smart, N. (2014). Safety in Numbers: Modern Cryptography from Ancient Arithmetic. In: What Is Computer Science?. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-04042-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04042-4_8

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04041-7

  • Online ISBN: 978-3-319-04042-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics