Cyclic Groups and Cryptography
In this chapter we prove the Primitive Root Theorem, which says that if p is prime, there is a unit b of order p − 1 modulo p. This is equivalent to the statement that the group Up of units of ℤ/pℤ is a cyclic group. Then we determine all numbers m for which Um is a cyclic group, and conclude with a look at discrete logarithm cryptography.
KeywordsAbelian Group Cyclic Group Cyclic Subgroup Pseudorandom Number Discrete Logarithm
Unable to display preview. Download preview PDF.