sol3 - CS346 Cryptography, Fall 2009 Homework 3, SOLUTIONS...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS346 Cryptography, Fall 2009 Homework 3, SOLUTIONS 1. (8 points) Suppose that for using RSA, Bob has chosen a large public modulus n for which the factorization cannot be found in a reasonable amount of time. Suppose Alice sends a message to Bob representing each alphabetic character as an integer between 0 and 25, and encrypting each as a separate plaintext character. Describe how Oscar can easily decrypt a message which is encrypted this way. Solution: Oscar can generate a table of the encrypted values corresponding to the 26 alphabetic characters, since he knows the encryption key. Then Oscar can decrypt the ciphertext character by character comparing the ciphertext with the entries of the table. 2. (8 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. Solution:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/07/2010 for the course C S 52475 taught by Professor Gal during the Fall '10 term at University of Texas at Austin.

Page1 / 3

sol3 - CS346 Cryptography, Fall 2009 Homework 3, SOLUTIONS...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online