Abstract
The treatment of number theory is elementary, in the technical sense. Number systems, factorization, the Euclidean algorithm, and greatest common divisors are covered, as is the reversal of the Euclidean algorithm to express a greatest common divisor (GCD) as a linear combination. Modular arithmetic and congruence are discussed. Simultaneous congruences are solved, and this leads to the Chinese remainder theorem.
Cryptography is introduced through classical ciphers, the scytale and the Caesar cipher. Additive ciphers, the Vigenè method, and substitution ciphers are discussed.
The treatment of modern cryptography starts with the Rivest, Shamir, and Adleman (RSA) system and public key systems in general. The security of the RSA and similar systems is discussed, together with attacks on RSA and related factorization problems. Signature systems, key exchange, and simulated random acts (such as coin tossing) also appear in this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This informal discussion of complexity is very superficial and is only intended to give you a rough idea of why RSA is secure. The interested reader should consult books on cryptography or computational theory.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Wallis, W.D. (2012). Number Theory and Cryptography. In: A Beginner's Guide to Discrete Mathematics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-8286-6_9
Download citation
DOI: https://doi.org/10.1007/978-0-8176-8286-6_9
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-8285-9
Online ISBN: 978-0-8176-8286-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)