RSA TEST PREPARATION

• Find 17^256 mod 41 using fast modular exponentation
• Find 9^123 mod 23 using fast modular exponentiation
• Find 24^6754 mod 89 using fast modular exponentiation
• True or False: any odd number could work as m, part of the public key.
• What is the maximal number of chars in the word that you would be able to encrypt with the following public key: m = 11983043, e = 11
• Encrypt the text CODE using the following public key: m = 11983043, e = 11.
• Decrypt the text ORIAK if you know private key: p = 3413, q = 3511, and e = 11. Find d and decrypt the message.
• Suppose you know m = 745651 and n = 743904. Find p and q
• Suppose you know m = 4005187 and e = 13, find p and q and decrypt the message: FVKCT
• Give an example of valid m and e but not valid plaintext
• Give an example of valid m and not valid e
• True or False: m is always odd number
• True or False: n is always even number
• True or False: any prime number will be valid e