Levels Tought:
Elementary,Middle School,High School,College,University,PHD
Teaching Since: | Jul 2017 |
Last Sign in: | 209 Weeks Ago, 4 Days Ago |
Questions Answered: | 15833 |
Tutorials Posted: | 15827 |
MBA,PHD, Juris Doctor
Strayer,Devery,Harvard University
Mar-1995 - Mar-2002
Manager Planning
WalMart
Mar-2001 - Feb-2009
please help solve the encryption problem , it is related to the encryption cipher
1. Consider the affine encryption cipher using A=1, B=2, C=3, … given by C=3p+2(mod26). Give a decryption cipher(equation) and show that it works by first encrypting and then decrypting and letter T.
2. Encrypt the word ”GO” using RSA with prime numbers p=13, q=17, and e=11.
a. Use the extended Euclidean Algorithm to solve for the decryption exponent d.
b. Use fast modular exponentiation to encrypt the letters “G” and O”
c. Check that parts a and b are correct by decrypting the cyphertext.
3. I sent the following word, encrypted with the public encryption key (47, 573, 571). Decrypt the message. (Hint: it is the best game ever)
----------- ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly