Documente Academic
Documente Profesional
Documente Cultură
1. (a) The Vigenere cipher is used with key “rocket” to encrypt the message “the phone
is bugged”. Find the ciphertext.
(b) Decrypt the ciphertext “DZGIFZUOPVYYPXJYACTIXQTYGJ” that came from
the Vigenere cipher with key “bluefog”.
2. (a) The Playfair cipher is used with keyword “crimson” to encrypt the message
“spread out your team”. Find the ciphertext.
(b) Decrypt the ciphertext “YTFCGCIDIOCHINRAYTFCKCPMAVBC” that came
from the Playfair cipher of part (a).
4. Suppose you are told that the plaintext “breathtaking” yields the ciphertext
“RUPOTENTOIFV” where the Hill cipher is used (but m is not specified). Determine
the encryption matrix.
7. Compute each of the following orders, if they exist: (a) ord11 (3), (b) ord21 (6), (c)
ord304 (21).
(a) Determine whether there are any primitive roots mod n = 81; if so, how many
will there be?
(b) If there are primitive roots mod n = 81, find the smallest one.
(c) If there are primitive roots, use the one you found in (b) to construct another.
Prime p = 773
Primitive root g =2
User Alice selects private key a = 333
User Bob selects private key b = 603
Write each answer as an integer in {1, 2, . . . , m − 1}, if you are working modulo m.
11. Suppose that Bob adopts the RSA cryptosystem with primes p = 43 and q = 73. He
chooses the (public key) encryption exponent to be e = 1195. Write each answer as an
integer in {1, 2, . . . , m − 1}, if you are working modulo m.
(a) Show that Bob’s choice of encryption exponent is legitimate, and find his corresponding
(private key) decryption exponent d.
(b) Suppose that Alice encrypts the plaintext message P = 1234 using the RSA
cryptosystem with Bob’s public key (n, e) = (3139, 1195). What is the resulting
ciphertext that would be sent to Bob?
(c) Go through the decryption process that would need to be done at Bob’s end, using
his private key (n, d) with decryption exponent that was determined in part (a).
12. (a) Use the prime number theorem to estimate the number of 1000-bit primes.
This will be the number of primes between 2999 and 21000 .
(b) If we randomly pick a 1000-bit odd integer, estimate the probability that it will
be prime.
13. Suppose that Alice and Bob decide to communicate with an ElGamal cryptosystem
using the prime p = 8263 and individual keys a = 856 and b = 3127, and using the
smallest primitive root g of p that satisfies g > 1700. Write each answer as an integer
in {1, 2, . . . , m − 1}, if you are working modulo m.
15. Find all solutions for each of the following congruences (use extended Euclidean
algorithm): (a) 6x ≡ 28 (mod 776), (b) 15x ≡ 21 (mod 1940).
17. Given that 1111118111111 is a prime, determine whether 1001 is a quadratic residue
(mod 1111118111111).
1234567
18. Compute the Jacobi symbol 11111111 without any factoring, other than dividing out
powers of two.
19. Let n = 713 be a Rabin modulus and let c = 289 be a ciphertext that is obtained by
Rabin encryption using this modulus. Determine all possible plaintexts.
——-The End———