Scribd
Upload
13 views1 page

Problems 9

The document contains homework problems related to cryptology, specifically focusing on RSA and Rabin cryptosystems, modular arithmetic, and properties of safe primes. It includes tasks such as factoring moduli, decrypting ciphertexts, using the Chinese Remainder Theorem, and proving properties of elements in multiplicative groups. The problems require mathematical proofs and computations involving prime numbers and their orders in modular systems.

Uploaded by

jazzy075
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
13 views1 page

Problems 9

The document contains homework problems related to cryptology, specifically focusing on RSA and Rabin cryptosystems, modular arithmetic, and properties of safe primes. It includes tasks such as factoring moduli, decrypting ciphertexts, using the Chinese Remainder Theorem, and proving properties of elements in multiplicative groups. The problems require mathematical proofs and computations involving prime numbers and their orders in modular systems.

Uploaded by

jazzy075
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

T-79.

5501 Cryptology
Homework 9
April 16, 2009

1. Suppose that n = 355044523 is the modulus and b = 311711321 is the public


exponent in the RSA Cryptosystem. Using Wiener’s Algorithm, attempt to factor
n. If you succeed, determine also the secret exponent a and φ(n).

2. Bob is using the Rabin Cryptosystem. Bob’s modulus is 40741 = 131 · 311. Alice
knows Bob’s modulus but not its factors. Alice wants to remind Bob of a date in
May and sends it to Bob encrypted. The ciphertext is 24270.

(a) Show how Bob decrypts the ciphertext. One of the possible plaintexts is a
date, which Bob accepts and discards the other decryptions.
(b) Alice happens to see one of the decryptions discarded by Bob. It is 5959. Show
how Alice can now factor Bob’s modulus.

3. Bob and Bart are using the Rabin Cryptosystem. Bob’s modulus is 2183 and Bart’s
modulus is 2279. Alice wants to send an integer x, 0 < x < 2183, encrypted to both
of them. She sends ciphertext 1479 to Bob and the ciphertext 418 to Bart. Carol
sees the ciphertexts and she knows Bob’s and Bart’s moduli. Show how Carol can
compute x without factoring of moduli. Hint: Use Chinese Remainder Theorem.

4. It is given that

122004 ≡ 4815 (mod 50101),

where 50101 is a prime. Show that the element α = 4815 is of order 25 in the
multiplicative group ZZ∗50101 .

5. Consider p = 1231, which is a prime. Find an element of order q = 41 in the


multiplicative group ZZ∗1231 .

6. A prime p is said to be a safe prime if (p − 1)/2 is a prime.

a) Let p be a safe prime, that is, p = 2q + 1 where q is a prime. Prove that an


element in ZZp has multiplicative order q if and only if it is a quadratic residue
and not equal to 1 mod p.
b) The integer 08012003 is a safe prime, since 4006001 is a prime. Find some
element of multiplicative order 4006001 in ZZ8012003 .

You might also like