## Root words activity answer key

RSA-in-Python Simple implementation of the RSA algorithm in Python and Python GUI(TkInter) ###(1) RSA: 1. select two primes p q 2. calculate n=pq 3. calculate t(n)=(p-1)(q-1); 4. select e gcd(t(n),e)=1 5. determine d ed=1 mod t(n) puclic key:pu{e,n} private key:pr{d,n} 6. encryption: ciphertext=plaintext ** e mod n 7. decryption: plaintext=ciphertext ** d mod n It is a bit tricky. Actually sorting is fine, because the order does not matter. Given any three valid and non-duplicate indexes (0 = P, Q, R N and P != Q, Q != R, R != P), we can get one and only one arrangement, whose items are an increasing array. The only meaning of 0 ≤ P Q R N is: P, Q and R are valid index; and P, Q and R are not duplicate.