Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

CS402 Cryptography: Worksheet, Exercises of Cryptography and System Security

33 practice questions are included in cryptography exercise

Typology: Exercises

2020/2021

Uploaded on 04/20/2021

ekanaaa
ekanaaa 🇺🇸

4.3

(28)

268 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS402 Cryptography: Worksheet
1. The letter “N” was found to be the most frequent letter in a large ciphertext produced using
a Caeser cipher over the alphabet A= 0, B = 1, ..., Z = 25. Decipher the following portion
of the ciphertext:
CQRB RBJ F N JT LRY QNA .
2. (a) Describe the Vigen`ere cipher.
(b) A Vigen`ere cipher over the 27-letter alphabet A= 0, B = 1, ..., Z = 25,= 26 was used
to produce the ciphertext
EK W W EK KW W E KK DQDI KLOF DT K KS RKC A P W K ZW QP X J W V K
SW N DDS IK DX E GKE W HK DW RQLV MRQP K DM W P HS R
OKQR OY P D RMQK QRLLOH DBK N P SRN P HK LLDH DN ZB CH KX
IB IK DP F W P KX W S WM RH LY K W DLY LRQLIJ W DDS MP H KM M R
LL X P DQZZ REK GP P P LIS .
The corresponding plaintext begins
A LON G LO NG TI M E AGO .
Determine the first 17 words of plaintext.
3. What basic property of the Vigen`ere cipher makes it significantly more secure than the
Caeser cipher for sending very short messages (such as a bank PIN or credit card details)?
4. What basic property of the Enigma cipher makes it significantly more secure than the Vi-
gen`ere cipher against a ciphertext only attack.
5. The ciphertext
T M Y
was produced by applying the affine enciphering function fE:Z26 Z26, x 7→ 9x+ 16 to
single letter message units over the alphabet A= 0, B = 1, ..., Z = 25. Determine the
plaintext.
6. The ciphertext
ES DCW N M H
was produced by applying a Hill cipher to 2-letter message units over the alphabet A=
0, B = 1, ..., Z = 25, with enciphering finction
fE:x
y7→ Ax
ywhere A=2 3
7 5 .
Calculate A1mod 26 and hence determine the first FOUR letters of plaintext.
7. Carefully explain each of the following italicized terms:
(a) Kerckhoff’s principle
(b) two factor authentication
(c) symmetric cipher
(d) public key cipher
(e) block cipher
(f) stream cipher
(g) key space
(h) ciphertext only attack
1
pf3
pf4

Partial preview of the text

Download CS402 Cryptography: Worksheet and more Exercises Cryptography and System Security in PDF only on Docsity!

CS402 Cryptography: Worksheet

  1. The letter “N” was found to be the most frequent letter in a large ciphertext produced using a Caeser cipher over the alphabet A = 0, B = 1, ..., Z = 25. Decipher the following portion of the ciphertext: CQRBRBJF N JT LRY QN A.
  2. (a) Describe the Vigen`ere cipher.

(b) A Vigen`ere cipher over the 27-letter alphabet A = 0, B = 1, ..., Z = 25, = 26 was used to produce the ciphertext EKW W EKKW W EKKDQDIKLOF DT KKSRKCA P W KZW QP XJW V K SW N DDSIKDXE GKE W HKDW RQLV M RQP K DM W P HSR OKQROY P DRM QKQRLLOHDBKN P SRN P HKLLDH DN ZBCHKX IBIKDP F W P KXW S W M RHLY KW DLY LRQLIJW DDSM P HKM M R LL XP DQZZREKGP P P LIS. The corresponding plaintext begins A LON G LON G T IM E AGO. Determine the first 17 words of plaintext.

  1. What basic property of the Vigen`ere cipher makes it significantly more secure than the Caeser cipher for sending very short messages (such as a bank PIN or credit card details)?
  2. What basic property of the Enigma cipher makes it significantly more secure than the Vi- gen`ere cipher against a ciphertext only attack.
  3. The ciphertext T M Y was produced by applying the affine enciphering function fE : Z 26 → Z 26 , x 7 → 9 x + 16 to single letter message units over the alphabet A = 0, B = 1, ..., Z = 25. Determine the plaintext.
  4. The ciphertext ESDCW N M H was produced by applying a Hill cipher to 2-letter message units over the alphabet A = 0 , B = 1, ..., Z = 25, with enciphering finction

fE :

x y

7 → A

x y

where A =

Calculate A−^1 mod 26 and hence determine the first FOUR letters of plaintext.

  1. Carefully explain each of the following italicized terms:

(a) Kerckhoff ’s principle (b) two factor authentication (c) symmetric cipher (d) public key cipher (e) block cipher (f) stream cipher (g) key space (h) ciphertext only attack

(i) known plaintext attack (j) frequency analysis attack (k) computationally secure cipher (l) perfectly secure cipher (m) forward secrecy of a cipher (n) public key signature with message recovery

  1. List the five main attributes/operations of an object oriented implementation of a cryptosys- tem.

  2. Determine, with proof, the size of the enciphering key space for an affine cipher fE : (Zp)d^ → (Zp)d, v 7 → AV + B over an alphabet of p letters with p a prime. When working over an alphabet with p = 29 letters, what is the smallest value of d for which the cipher could be considered computationally secure against a ciphertext only attack? Justify your answer.

  3. Let P, C, K denote respectively the plaintext space, ciphertext space and key space of a given cryptosystrem. Assuming that each of these spaces is finite, that the cryptosystem is perfectly secure and that every c ∈ C has non-zero probability of occuring, prove the inequalities |K| ≥ |C| ≥ |P|.

  4. Describe one perfectly secure (though possibly impractical) cryptosystem. By carefully stat- ing and using a theorem of Shannon, or otherwise, explain why the cryptosystem is perfectly secure.

  5. (a) Explain what is meant by an L-bit linear feedback shift register, and explain how it is represented by its connection polynomial. (b) A 4-bit linear feedback shift register with connection polynomial C(C) = 1 + X + X^3 is used to produce a pseudo-random sequence of binary digits, staring s 0 = 0, s 1 = 0, s 2 = 1, s 3 = 1. By listing the next few terms of the pseudo-rndom sequence, determine its period.

  6. The enciphering key for a binary stream cipher is produced using a 3-bit linear feedback shift register. It is known that the cipher converts the plaintext string

into the ciphertext string

(a) Determine the first sixteen binary digits in the enciphering key. (b) Determine the connection polynomial of the linear feedback shift register.

  1. Why is the non-linear function f (x 1 , x 2 , x 3 ) = x 1 x 2 + x 2 x 3 + x 3 a poor choice if used to combine three binary linear feedback shift registers in order to get a “non-linear” pseudo- random sequence.
  2. Carefully describe the A5/1 stream cipher which is used to encrypt the on-air traffic in the GSM mobile phone networks in Europe and the US.
  3. Diffie and Hellman published a paper in 1976 on public key cryptography. The idea had in fact been invented five years earlier, independently and under the name non-secret encryption, by James Ellis who worked for the British govenrment’s communications headquarters GCHQ
    • an organization not always eager to publicize its work. What is public key cryptography?
  1. Let E denote the set of points on the elliptic curve over Q defined by y^2 = x^3 + ax + b. Describe (without giving precise formulae) the operations of addition and subtraction which give E the structure of an abelian group.
  2. Briefy describe Lenstra’s elliptic curve factorization algorithm.
  3. Use Pollard’s rho method, with the given f (x) and x 0 , to factorize the following integers n. In each case compare xk with xj for which j = 2h^ − 1 (where 2h^ ≤ k < 2 h+1).

(a) n = 91, f (x) = x^2 − 1, x 0 = 2. (b) n = 8051, f (x) = x^2 + 1, x 0 = 1. (c) n = 7031, f (x) = x^2 − 1, x 0 = 5.