Académique Documents
Professionnel Documents
Culture Documents
February 2010
A D N Q
B E O R
C F P S
D G Q T
E H R U
F I S V
G J T W
H K U X
I L V Y
J M W Z
K N X A
L O Y B
M P Z C
A E N F
B K O Z
C G P B
D U Q S
E J R A
F L S O
G V T D
H C U P
I X V Q
J T W R
K Y X M
L N Y I
M H Z W
A Sample Cryptogram
A cryptogram on the beauty of cryptograms...
E.
RSA Example
RSA Example
RSA Example
1. Let p = 97 and q = 101. Then n = pq = 9797 and (n) = (p 1)(q 1) = 9600. 2. Choose k = 23 and j = 2087. One can verify that k and (n) are relatively prime, and that kj 1 mod (n).
RSA Example
1. Let p = 97 and q = 101. Then n = pq = 9797 and (n) = (p 1)(q 1) = 9600. 2. Choose k = 23 and j = 2087. One can verify that k and (n) are relatively prime, and that kj 1 mod (n). 3. We will encrypt the message HELLO. We will encode letters using the previously described mechanism: A 00, B 01, etc.
070 7023 mod 9797 7002 411 41123 mod 9797 8208 111 11123 mod 9797 4131 499 49923 mod 9797 4228
070 7023 mod 9797 7002 411 41123 mod 9797 8208 111 11123 mod 9797 4131 499 49923 mod 9797 4228 Cipher: 7002 8208 4131 4228
070 7023 mod 9797 7002 411 41123 mod 9797 8208 111 11123 mod 9797 4131 499 49923 mod 9797 4228 Cipher: 7002 8208 4131 4228 7002 70022087 8208 82082087 4131 41312087 4228 42282087 mod mod mod mod 9797 70 9797 411 9797 111 9797 499