Abstract
This chapter describes some industrial applications of number theory, via computer science. We succinctly describe the main algorithms as well as their theoretical complexity or computation time. We use the notation O(f(n)) to denote a function ≤Cf(n); furthermore, the unimportant—at least from a theoretical point of view—constants which appear will be ignored. In the following sections, we introduce the basics of cryptography and of the “RSA” system, which motivates the study of primality tests and factorization methods. We finish the chapter with an introduction to error-correcting codes, which will lead us into the study of cyclotomic polynomials.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Hindry, M. (2011). Applications: Algorithms, Primality and Factorization, Codes. In: Arithmetics. Universitext. Springer, London. https://doi.org/10.1007/978-1-4471-2131-2_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2131-2_2
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2130-5
Online ISBN: 978-1-4471-2131-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)