# Algebraic Aspects of Number Theory

## Abstract

Chapter 10 discusses some more interesting properties of integers, in particular, properties of prime numbers and primality testing by using the tools of modern algebra, which are not studied in Chap. . In addition, the applications of number theory, particularly those directed towards theoretical computer science, are presented. Number theory has been used in many ways to devise algorithms for efficient computer and for computer operations with large integers. Both algebra and number theory play together an increasingly significant role in computing and communications, as evidenced by the striking applications of these subjects to the fields of coding theory and cryptography. The motivation of this chapter is to provide an introduction to the algebraic aspects of number theory, mainly the study of development of the theory of prime numbers with an emphasis on algorithms and applications, necessary for studying cryptography, to be discussed in Chap. . This chapter starts with the introduction to prime numbers with a brief history. Several proofs of the celebrated theorem of Euclid stating that there exist infinitely many primes are given in this chapter. Further discussion of Fermat numbers, Mersenne numbers, Carmichael numbers, quadratic reciprocity, multiplicative functions such as Euler phi-function, number of divisor functions, sum of divisor functions etc. has been made. This chapter ends with a study on primality testing both deterministic and probabilistic such as Solovay–Strassen and Miller–Rabin probabilistic primality tests.

## Keywords

Prime Number Multiplicative Function Primitive Root Primality Testing Quadratic Residue
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

2. Agrawal, M., Kayal, N., Saxena, N.: Primes is in P. Preprint, IIT Kanpur. http://www.cse.iitk.ac.in/news/primality.pdf (August 2002)
3. Burton, D.M.: Elementary Number Theory. Brown, Dulreque (1989) Google Scholar
4. Dietzfelbinger, M.: Primality Testing in Polynomial Time from Randomized Algorithms to “PRIMES is in P”. LNCS, vol. 3000, Tutorial. Springer, Berlin (2004) Google Scholar
5. Hoffstein, J., Pipher, J., Silverman, J.H.: An Introduction to Mathematical Cryptography. Springer, Berlin (2008) Google Scholar
6. Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, 2nd edn. Springer, Berlin (1990) Google Scholar
7. Jones, G.A., Jones, J.M.: Elementary Number Theory. Springer, London (1998) Google Scholar
8. Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall/CRC, London/Boca Raton (2007) Google Scholar
9. Koblitz, N.: A Course in Number Theory and Cryptography, 2nd edn. Springer, Berlin (1994) Google Scholar
11. Mollin, R.A.: Advanced Number Theory with Applications. CRC Press/Chapman & Hall, Boca Raton/London (2009) Google Scholar
12. Ribenboim, P.: The Little Book of Bigger Primes. Springer, New York (2004) Google Scholar
13. Stinson, D.R.: Cryptography, Theory & Practice. CRC Press Company, Boca Raton (2002) Google Scholar