Scribd
Upload
107 views6 pages

Cryptology and Coding Theory Exam 2023

Cryptology

Uploaded by

biqzedd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
107 views6 pages

Cryptology and Coding Theory Exam 2023

Cryptology

Uploaded by

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

EXAMINATIONS FOR SEPTEMBER - DECEMBER 2023 SEMESTER

COURSE CODE: CS 205


COURSE NAME: CRYPTOLOGY AND CODING THEORY

INSTRUCTIONS:

1. This is not an Open Book Examination, though you have a practical


section that you will submit online using the eLearning platform 48 Hours
after the physical part.
2. Section A is compulsory and carries 40 marks.
3. Answer any other ONE Question from Section B. Each question carries 20
marks.
4. Section C is compulsory and each Question carries 20 Marks
5. Indicate questions attempted
6. Plagiarism will earn you zero (0) Marks. Demonstrate your understanding
of concepts to be best of your ability.
7. Follow the instructions of the examination supervisor.

GOOD LUCK!!

* The exam Should be completed in 3 Hours. You have 1 extra hour to complete all
the submission formalities.
SECTION A: (40 Marks)
(a) Explain what you think Cryptology is all about giving suitable example
of how you interact with Cryptology in your day-to-day activities as a
student. (4)
(b)Describe how a one-way hash function may be used for message
authentication (5).
(c) Explain how public key cryptography may be used for identification.
(5)
(d)Explain what a nonce is and the reason for using a nonce. [3]
(e) Briefly explain your understanding of the following terms; (2 @)
Cryptology
Cryptography
Cryptanalysis
Crypto
(f) Given a 3DES implementation defined by K 1 = 100110, K2 = 0011, K3 =
111010 and E (k, m) = k ⊕ m. Give the cipher text of the message, m
= 10110011 (6).
(g)Explain Shannon’s Channel Coding Theorem. (5)
(h)Alice wants to encrypt some sequence of independent decimal digits
and send to Bob. Let EK denote the encryption function operating on
decimal digits. A sequence of decimal digits M1, M2, . . . , Mn ∈ Z10
is encrypted to a sequence of ciphertext symbols C1, C2, . . . , Cn , Ci ∈
Z10 by Ci = EK (Mi ), ∀i, 1 ≤ i ≤ n.

Determine which of the following mappings that are possible


encryption functions: EK (M ) = M, EK (M ) = K, EK (M ) = M + K, EK
(M ) = M · K, EK (M ) = M K +1 , if M, K ∈ Z10 , and all operations
above are performed (mod 10). (4)
SECTION B: (20 Marks)
Question 2
(a) Differentiate stream ciphers from block ciphers. Give suitable

examples of each type of cipher and where it is used in practice. (4)

(b)Given the 3 round Feistel network below defined with the following

parameters; K1=100111, K2 = 111000, K3 = 010101, R0 = 110010, L0 =

001110, f(x, k) = x ⊕ k

Evaluate R1; L1; R2; L2; R3; L3 (8)

c) Given a Feistel Network describe as follows;

 Ri-1 = Li, Li -1 = Fi(Li) ⊕ Ri

 F(Li) = Li + 1011 ⊕k

 K1 = 0011, K2 = 0110, K3 = 1110, R3 = 1101, L3 = 0100.

Give values for R1, L1, R2, L2, R0, L0. (8)

Question 3
Suppose Alice wants to send her Bank a message that includes her promise

to pay Charlie $50 dollars. Alice and the Bank have a shared secret X. Alice

initiates a conversation with the Bank by sending: A + B + n (Alice’s

identity, the Bank’s identity, and a nonce). Assume that Bank tracks the

nonces used by Alice for X.

Answer the following questions.

(a) Specify a valid reply for the Bank (i.e., a message generated by the

Bank to be sent to Alice) that would enable Alice to verify that the

reply came from someone who knows the secret X. (5)

(b) In order to setup a secure communication, Alice and the Bank need a

secret session key. Suppose that the Bank chooses a session key K by

XORing some pseudorandom data with X and includes it with the reply

in (a) above. Extend message (a) to provide the session key to Alice

securely as well. (3)

(c) Now, Alice can submit her message (“Pay Charlie $50 from my

account”) to the Bank. Write the message in such a way that Charlie

cannot replay it (Hint: you will need to add something to the message

that the Bank is capable of checking to prevent replay.). (5)

(d) Why is it that a “man-in-the-middle” attack cannot result in an

adversary determining the key K in this protocol? (4)

(e) What is the major advantage of public key cryptography over

symmetric key cryptography? (3)


Question 4

a) Explain the speed-size considerations of ciphers. Cite the following

ciphers in your illustration; DES, 3DES, AES. (3)

b) Encryption is a very crucial technique of securing packets in transit;

discuss the cost that comes along with it. (5)

c) Explain how encryption relates to the following:

i. Preserving Data Integrity (4)

ii. Maintaining Confidentiality (4)

iii. Authenticating Network Clients. (4)

SECTION C ~ PRACTICAL (40 Marks)

Question 5

Suppose Alice would like to send Bob a message without allowing a

malevolent associate Eve read the message. There is only one way to

absolutely ensure 100% security: the use of a one-time pad. Using C,

implement a stream ciphers code, which attempts to simulate the

characteristics of one-time pads.

Question 6

a). Implement a caeser’s cipher encryption scheme using C that converts


a given plaintext into cipher text while specifying the key.
b). Also write a decryption scheme for the encryption scheme in a) above.

You might also like