RSA-Math-Illustration

Page #43554543 of Chapter: Crypto-for-the-rest-of-us

level indicator

****

let P=3, Q=11. Accordingly n=33 and Z=20. Then:

  • We pick e=3 since gcd(3,20)=1
  • We solve 3d= 1 mod 20 to find d=7

    To encrypt "YES" one would:

  • list the numeric values of YES: 25, 5, 19
  • encrypt 25 to 253 mod 33 = 16
  • encrypt 5 to 53 mod 33 = 26
  • encrypt 19 to 193 mod 33 = 28
  • translate the sequence: 16,26,28 to "PZ+" which is the ciphertext.

    To decrypt "PZ+" one would reverse 167=25, 267=5, 287=19, map the sequence 25,5,19 to "YES".

  • * Version CE-H6703 (SERVER) Crypto Academy