As per my knowledge i solved this question .Thank you.

Discrete Mathematics - RSA Algorithm and Mod These are problems concerning the RSA algorithm and Modulo. A. In RSA, suppose bob chooses p = 3 and q = 43. Determine one correct value of the public exponent e, your choice should be the smallest positive integer that is greater than 1. Justify your answer. B. For the e's value you chose above, compute the corresponding secret exponent d. Show your work. C. Compute 540Mod13 D. Compute 5-1Mod11
In public key cryptosystems, the RSA is the most commonly used algorithm. Answer the following questions: - 1. In the RSA algorithm, what is the security flaw with choosing e = 1 for the public key? (Hint: the RSA formula for encryption is c = M e mod n). 2.You are given a cipher text C=10 by a user whose public key is e=5, n=35. Break the code.
Question 29 1 pts In an application of the RSA cryptosystem, Bob selects positive integers p, q, e, and d, where p and a are prime. He publishes public key (e, N), where N =p'q. the number d is the decryption key. 0 = (p-1)(q-1). Select all the statements that are correct. Ifm is not equal to por q, then (m) mod N=m It must be the case that d'e mod 0 - 1 If mis not equal to por...
5. (20 points) Solve the system of congruences x (mod 13) and 11 (mod 24). Find the smallest nonnegative integer solution to the system.
Problem 4. The plaintext P has been encrypted with RSA n = 65, e = 29 to yield the ciphertext C = 3 = P29 mod 65. Find P using the decryption key d, and prove the congruence class of P that solves this congruence is unique.
p=3, q=7
Suppose that Bob wants to create an example of an RSA public-key cryptosystem by using the two primes p ??? and q ???. He chooses public encryption key e He was further supposed to compute the private decryption key d such that ed 1 mod A(pq)). However, he confuses A and and computes instead d' such that ed' =1 (mod P(pq)). (i) Prove that d' works as a decryption key, even though it is not necessarily the same...
(i) Find Bezout’s Identity for 53 and 61. Using RSA, you send Alice the modulus m = 3233 (= 53 · 61) and the encrypting exponent e = 7. Alice has a two-letter message that she turns into a number ≤ 2626 and encrypts and sends you. You receive c = 1067. You have already determined that the decrypting exponent is d = 1783. (ii) Find cd (mod 53) and cd (mod 61). (iii) Then use Bezout’s identity from (i)...
An RSA cipher has public key pq = 65 and e = 7. Translate the message YES into its numeric equivalent, and use the formula C = Me (mod pq) to encrypt the message. Decrypt the ciphertext 50 16 and translate the result into letters of the alphabet to discover the message.
Show that plain RSA is malleable. Discuss if AES and RSA-OAEP are malleable.
Discrete Mathematics. (a) Use modular arithmetic to find 1040 mod 210. Show your working. (b) An RSA cryptosystem uses public key pq = 65 and e = 7. Decrypt the ciphertext 57 9 and translate the result into letters of the alphabet to discover the message.