Finite Field Notes
I learned all this for cyclic keys, then I forgot it. This time I'm taking notes
- Totient
The number of values k for which 1 <e; k <e; n and gcd(n,k) == 1. For any prime, φ(p) = p-1.
I learned all this for cyclic keys, then I forgot it. This time I'm taking notes
The number of values k for which 1 <e; k <e; n and gcd(n,k) == 1. For any prime, φ(p) = p-1.