You have intercepted a message encrypted using the RSA algorithm. The public key is pq=3127 with encryption exponent e = 491. The encrypted message is 1256, 317, 3110, 2134, 1253, 742, 1894, 50, 2738. The message text was encoded using ASCII, with each number standing for one character. Decrypt the message by following these steps. 1.) Find p and q by factoring 3127. Feel free to use whatever technology you like to do this. 2.) Calculate d, the multiplicative inverse of e = 491 mod (p 1)(q 1), by doing the Euclidean algorithm to find gcd(491, (p 1)(q 1)), and then writing the gcd as a linear combination of 491 and (p 1)(q 1). The coefficient of 491 will be d. 3.) Decrypt the message by raising each encrypted message block to the power of d and then reducing modulo pq. Feel free to use Wolfram Alpha or any other technology for this. 4.) Convert from ASCII to English Solution Plaintext is converted into cipher text in encrypted mechnisam are using finally get the ciphertext,this mechanism is called Encryption,and reverse mechanisma is called decryption.using RSA algoritm given The encrypted message is 1256, 317, 3110, 2134, 1253, 742, 1894, 50, 2738. public key= 3127 Decrypted the message: p and q are factoring is 3127 using no .of keysare existingsymetric key decrypted mecanism Y=E(K,X); n*n-1/2= 654 the multiplicative inverse of e = 491 mod (p 1)(q 1) solving Euclidean algorithm gcd(491,(p-1)(q-1)) then using normalized formation symmetric key are involved then assending order finally output comes is 238 A45ghb876kli907 .

1. You have intercepted a message encrypted using the RSA algorithm. The public key is pq=3127
with encryption exponent e = 491. The encrypted message is 1256, 317, 3110, 2134, 1253, 742,
1894, 50, 2738. The message text was encoded using ASCII, with each number standing for one
character. Decrypt the message by following these steps.
1.) Find p and q by factoring 3127. Feel free to use whatever technology you like to do this.
2.) Calculate d, the multiplicative inverse of e = 491 mod (p 1)(q 1), by doing the Euclidean
algorithm to find gcd(491, (p 1)(q 1)), and then writing the gcd as a linear combination of 491
and (p 1)(q 1). The coefficient of 491 will be d.
3.) Decrypt the message by raising each encrypted message block to the power of d and then
reducing modulo pq. Feel free to use Wolfram Alpha or any other technology for this.
4.) Convert from ASCII to English
Solution
Plaintext is converted into cipher text in encrypted mechnisam are using finally get the
ciphertext,this mechanism is called Encryption,and reverse mechanisma is called
decryption.using RSA algoritm given The encrypted message is 1256, 317, 3110, 2134, 1253,
742, 1894, 50, 2738. public key= 3127
Decrypted the message:
p and q are factoring is 3127 using no .of keysare existingsymetric key decrypted mecanism
Y=E(K,X);
n*n-1/2= 654
the multiplicative inverse of e = 491 mod (p 1)(q 1) solving Euclidean algorithm gcd(491,(p-
1)(q-1)) then using normalized formation symmetric key are involved then assending order
finally output comes is 238
A45ghb876kli907