Abstract
The following result will be really important for us: (Fermat’s Little Theorem. If p is a prime number, any a is any integer, then \(a^p\equiv a\pmod p\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Rubinstein-Salzedo, S. (2018). A Second Look at Number Theory. In: Cryptography. Springer Undergraduate Mathematics Series. Springer, Cham. https://doi.org/10.1007/978-3-319-94818-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-94818-8_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94817-1
Online ISBN: 978-3-319-94818-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)