


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
33 practice questions are included in cryptography exercise
Typology: Exercises
1 / 4
This page cannot be seen from the preview
Don't miss anything!
(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.
fE :
x y
x y
where A =
Calculate A−^1 mod 26 and hence determine the first FOUR letters of plaintext.
(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
List the five main attributes/operations of an object oriented implementation of a cryptosys- tem.
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.
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|.
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.
(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.
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.
(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.