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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wikipedia: Alice and Bob. http://en.wikipedia.org/wiki/Alice_and_Bob
Wikipedia: Block cipher. http://en.wikipedia.org/wiki/Block_cipher
Wikipedia: Block cipher modes of operation. http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation
Wikipedia: Coprime. http://en.wikipedia.org/wiki/Coprime
Wikipedia: Diffie-Hellman. http://en.wikipedia.org/wiki/Diffie-Hellman
Wikipedia: Discrete logarithm. http://en.wikipedia.org/wiki/Discrete_logarithm
Wikipedia: ElGamal encryption. http://en.wikipedia.org/wiki/ElGamal_encryption
Wikipedia: Euclidean algorithm. http://en.wikipedia.org/wiki/Euclidean_algorithm
Wikipedia: Euler’s totient function. http://en.wikipedia.org/wiki/Euler’s_totient_function
Wikipedia: Exponentiation by squaring. http://en.wikipedia.org/wiki/Exponentiation_by_squaring
Wikipedia: Extended Euclidean algorithm. http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
Wikipedia: GCHQ. http://en.wikipedia.org/wiki/Government_Communications_Headquarters
Wikipedia: Identity function. http://en.wikipedia.org/wiki/Identity_function
Wikipedia: Integer. http://en.wikipedia.org/wiki/Integer
Wikipedia: Key agreement protocol. http://en.wikipedia.org/wiki/Key-agreement_protocol
Wikipedia: Man-in-the-middle attack. http://en.wikipedia.org/wiki/Man-in-the-middle_attack
Wikipedia: Number theory. http://en.wikipedia.org/wiki/Number_theory
Wikipedia: One-way function. http://en.wikipedia.org/wiki/One-way_function
Wikipedia: Prime factor. http://en.wikipedia.org/wiki/Prime_factor
Wikipedia: Prime number. http://en.wikipedia.org/wiki/Prime_number
Wikipedia: Public key cryptography. http://en.wikipedia.org/wiki/Public-key_cryptography
Wikipedia: RSA. http://en.wikipedia.org/wiki/RSA
Wikipedia: RSA Problem. http://en.wikipedia.org/wiki/RSA_problem
Wikipedia: Symmetric key cryptography. http://en.wikipedia.org/wiki/Symmetric_key_algorithm
Wikipedia: Transport Layer Security (TLS). http://en.wikipedia.org/wiki/Transport_Layer_Security
Author information
Authors and Affiliations
Rights 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)