{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# hw3 - decrypt the message 4(10 points If an RSA userâ€™s...

This preview shows page 1. Sign up to view the full content.

CS346 Cryptography, Fall 2010 Homework 3, Due October 12 1. (10 points) Problem 17 (Chapter 6.8) 2. (10 points) Problem 27 (Chapter 6.8) 3. (10 points) Suppose that Oscar intercepts a message encoded with the RSA encryption, but he does not know the private key. Assume that n = p · q is the public modulus, and b is the public exponent. Suppose someone tells Oscar, that one of the plaintext blocks has a common factor with n . Explain how Oscar can use this information to
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: decrypt the message. 4. (10 points) If an RSA userâ€™s public key is n = 17 Â· 43 and b = 29, what is the private exponent a ? Explain what you do and include the partial results of your calculations. HINT: Use the extended Euclidean algorithm. It will only take a few steps, you can do it by hand. EXTRA CREDIT (10 points) Problem 23 (Chapter 6.8)...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online