Scribd
Upload
26 views4 pages

CSC 4209 Cryptology and Coding Theory

The document outlines the examination instructions for a course on Cryptology and Coding Theory at St. Paul's University for the May-August 2022/2023 semester. It includes sections with compulsory and optional questions covering topics such as encryption, Hamming codes, RSA key generation, Feistel systems, and various cryptographic techniques. The exam consists of theoretical questions and practical problems requiring calculations and explanations related to cryptography.

Uploaded by

colindeveloper4
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
26 views4 pages

CSC 4209 Cryptology and Coding Theory

The document outlines the examination instructions for a course on Cryptology and Coding Theory at St. Paul's University for the May-August 2022/2023 semester. It includes sections with compulsory and optional questions covering topics such as encryption, Hamming codes, RSA key generation, Feistel systems, and various cryptographic techniques. The exam consists of theoretical questions and practical problems requiring calculations and explanations related to cryptography.

Uploaded by

colindeveloper4
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/ 4

ST.

PAUL’S UNIVERSITY
S

UN
P A U L ’
Private Bag 00217 Limuru, 00217, KENYA

I VE R S I TY
Tel: 020-2020505/2020510/0728-669000/0736-424440
.
S T

SE R TY
VANT
S OF GO D AND HUMANI

SCHOOL OF COMMUNICATION AND COMPUTER STUDIES

BACHELOR OF SCIENCE IN COMPUTER SCIENCE


BACHELOR OF COMPUTER SCIENCE

MAY - AUGUST 2022/2023 SEMESTER

CSC 4209: CRYPTOLOGY AND CODING THEORY

DATE: AUGUST, 2023 TIME: 2 hours


INSTRUCTIONS
Section A is compulsory. Answer any other two questions in section b.

SECTION A (COMPULSORY – this section carries 30 Marks)


Question One

a) Describe four reasons why it would be necessary to encrypt the message. (4 Marks)

b) In a non-secure channel, mention four things that Eavesdropper could possibly do (4 Marks)

c) Find the inverse of the following matrix:

(4 Marks)

d) Compute the value of 123241 mod 35. (4 Marks)


e) With the aid of a diagram, discuss the basic communication scenario in cryptography. (6 Marks)
f) Describe the following types of attack that Eve might be able to use.
i. Ciphertext only (2 Marks)
ii. Known plaintext (2 Marks)
iii. Chosen plaintext (2 Marks)
iv. Chosen plaintext (2 Marks)

Page 1 of 4
SECTION B (answer ANY TWO. Each question carries 20 Marks)
Question Two

a) Show the steps followed in determining the parity bits of a hamming code (4 Marks)
b) Use hamming codes to detect and correct the error of a codeword sent as 111001101 and then received
as 110001101. (8 Marks)
c) Give the steps followed in order to generate secure RSA keys, hence generate and RSA key given two
primes: p=11 and q=13 (8 Marks)

Question Three
a) Given the plaintext X=110011000101 and a master key K=111001001, use the substitution boxes below to
perform one round encryption of X for the given Feistel system.

S-BOX 1 S-BOX 2
010 100 000 101 001 110 011 111 111 010 001 101 100 000 110 011
101 011 110 001 000 100 111 010 000 110 011 111 010 101 100 001

Use the expander function:

(5 Marks)

b) Given the key “YOTUI”, use the Playfair technique to Decrypt the ciphertext
IYOELRELYVBZIPSDROLHRBFAVM. (5 Marks)
c) Describe the Data Encryption Standard DES. (6 Marks)
You receive the Cipher text shown below from a friend;
GABMAWCNGQRQAYT
Required:
Assuming you have the same Key as in (b) above, use the Vigenere table below to produce the
Plaintext.

Page 2 of 4
(4 Marks)

Question Four

a) Find the fixed-length codes and prefix-free codes that use the least space if it is needed to store
messages made up of 4 characters a, b, c, d with frequencies 60, 5, 30, 5 (percent) respectively.
(4 Marks)
b) The string below is to be sent over a network.

BCAADDDCCACACAC

Use it to describe how Huffman code compression works. (Use a table to summarize your results)
(8 Marks)

c) Given that some plain text was encrypted with the formula y=E(x)=(5x+8)(mod 26), Decrypt the
cipher text WIQVAZILAVC (8 Marks)

Question Five

a) With Justification, give the key space for an affine cipher. (2 Marks)
b) Distinguish between Public (asymmetric) key cryptosystem and Private (symmetric) key
cryptosystem. (4 Marks)
c) Define Fermat's primality test and use your definition to check if the integer 15 is prime.
(4 Marks)

Page 3 of 4
d) Differentiate between Differential and Linear cryptanalysis (4 Marks)
e) Describe any SIX features of an Advanced Encryption System (6 Marks)

Page 4 of 4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy