|
Euler's Code
|
 
|
Consider Euler's Code, introduced in Section 4.4.3 of
this.
1. -
Using 17 as the value for p (the prime modulus),
encrypt and decrypt the letter j using Euler's
Code. Use 3 or 4 for your encryption key,
whichever is better. Defend your choice.
Show the calculations determining your
decryption
key and verify that it is an inverse
of your encryption key in the right modulus.
2.
-
The inverse of the encryption key is computed two
different ways in the example worked out for you
in Section 4.4.3. You may use either method (using Euler's theorem
is probably simpler than using Euclid's algorithm).
But whichever way you use, show your work.
-
|