Abstract
In Chapter 4, we applied number theory to cryptography. Many techniques and tools in cryptography are based on primality, factorization, randomness, etc., and we have already seen how Euclid’s algorithm works. In this chapter, we present in more depth the concepts and ideas behind them, as well as more advanced techniques that deal with characteristics of integer numbers.
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
Rights and permissions
Copyright information
© 2021 Marius Iulian Mihailescu and Stefania Loredana Nita
About this chapter
Cite this chapter
Mihailescu, M.I., Nita, S.L. (2021). Number Theory. In: Cryptography and Cryptanalysis in MATLAB. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-7334-0_5
Download citation
DOI: https://doi.org/10.1007/978-1-4842-7334-0_5
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-7333-3
Online ISBN: 978-1-4842-7334-0
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books