Scribd
Upload
37 views1 page

QP 295-HW10

This document contains 5 problems related to cryptography for homework assignment #10. Problem 1 asks to decrypt an RSA encrypted message. Problem 2 asks if it is safe for Bob to generate a new public/private key pair rather than a new modulus if his private key is leaked. Problem 3 asks to show that Carmichael numbers are easy to factor and illustrates on the number 1729. Problem 4 asks for an algorithm to determine the decryption exponent d2 corresponding to an encryption exponent e2 without using factorization or exponentiation. Problem 5 asks to provide witnesses of compositeness or probable primes for the numbers 1009 and 2009. Problem 6 asks to estimate the bit operations to perform a witness test enough times to have less than a 10^-

Uploaded by

Neeraj Kalra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views1 page

QP 295-HW10

This document contains 5 problems related to cryptography for homework assignment #10. Problem 1 asks to decrypt an RSA encrypted message. Problem 2 asks if it is safe for Bob to generate a new public/private key pair rather than a new modulus if his private key is leaked. Problem 3 asks to show that Carmichael numbers are easy to factor and illustrates on the number 1729. Problem 4 asks for an algorithm to determine the decryption exponent d2 corresponding to an encryption exponent e2 without using factorization or exponentiation. Problem 5 asks to provide witnesses of compositeness or probable primes for the numbers 1009 and 2009. Problem 6 asks to estimate the bit operations to perform a witness test enough times to have less than a 10^-

Uploaded by

Neeraj Kalra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

MATH 295A/395A: CRYPTOGRAPHY

HOMEWORK #10

Problems for all


Problem 1. Bob chooses the RSA modulus
n = 10695247887291864445212840991549892162383758706171226800213733345880651267343687
and
e = 1857308780599082935579426134526996671022161384368318177549870987520554825439779
and because he is short for time chooses a small decryption exponent. Alice sends the secret message
b = 5876903442995476139711640244861982014547608694076473777226913452306949807294092
to Bob by converting her codeword of seven letters into ASCII bytes, interpreting this as the
binary expansion of an integer, and encrypting it using RSA. Decrypt the message and recover the
plaintext codeword.
Problem 2. In the RSA public-key encryption scheme, each user has a public key e and a private
key d. Suppose Bob leaks his private key. Rather than generating a new modulus, he decides to
generate a new public and a new private key. Is this safe?
Problem 3. A Carmichael number is a composite integer n > 1 such that an a (mod n) for
all a Z. Show that in practice Carmichael numbers are easy to factor into primes. Illustrate the
method on the Carmichael number n = 1729.
Problem 4. Let n be an RSA modulus, e1 an encryption exponent, d1 the corresponding decryption
exponent, and e2 a second encryption exponent. Given the data n, e1 , d1 , e2 , exhibit a fast and
certain algorithm that determines the corresponding decryption exponent d2 which does not using
random choices, the factorization of n, or exponentiation modulo n. Illustrate your algorithm on
n = 119, e1 = 23, d1 = 23, e2 = 7 and n = 119, e1 = 23, d1 = 23, e2 = 11.
Problem 5. For the following integers either provide a witness for the compositeness of n or
conclude that n is probably prime by providing 5 numbers that are not witnesses.
(a) n = 1009.
(b) n = 2009.
Problem 6. Using big-O notation, estimate the number of bit operations required to perform the
witness test on a number n enough times so that, if n passes all of the tests, it has less than a 10m
chance of being composite.

Date: Due Friday, November 5, 2010.


1

You might also like