1. Select two prime numbers,aand b.
2. findn = a . b
3. findZ = (a - 1) . (b - 1)TheZis often called "totient".
4. find a prime numberKso thatKis co-prime toZ(meaning,Zis not divisible by K).
5. observe nand k, you will need them subsequently.
6. Proceed with the equation J . K. J to calculate(mod Z).
7. Take note of J, you will also need it later.
8. Now, choose any number P.
9. CalculateP^k (mod n) = E. Take note ofE
10. Now, assume you forgot what your number P was. The way to get that number P back is using this equation:E^j = P (mod n). Calculate P , using your values forJ, E, n.
11. Explain these steps and the numbers n and k, j, P and E and also discuss what functions these numbers have and how they might be used in computing.