Cryptography

one can become two

[Link]

crypto - prestudy
crypto-conceptual
crypto-memorizable

that are only memorizable and has got low priority are to be studied at last.

Of course. Based on the provided syllabus and all the past exam papers for Cryptography
(CRYPTO), here is the comprehensive chapter-wise classification of questions in your
requested format.

Unit 1: Introduction and Classical Ciphers

2082 Q5 CRYPTO Given the key "HELLOWORLD", encrypt the plaintext "TURINGTEST"
using Play fair cipher.
2082 Q10 CRYPTO Decrypt the ciphertext "HI" using Hill Cipher where the key is [5/4 3/3].
2081 Q4 CRYPTO Show the encryption of plain text "ALGORITHM" using the key
"PSEUDOCODE" using playfair cipher.
2081 Q10 CRYPTO Using Vignere cipher with key = "worlds", encrypt the plain text "hello
everyone".
2080 Q4 CRYPTO Show encryption and decryption of "csit" using hill cipher having key, k =
[3 2; 5 7].
2080 Q10 CRYPTO How substitution ciphers are different from transposition ciphers? Given
a message M="CSIT PROGRAM IS A HOT CAKE", encrypt M using Rail Fence cipher with
rail size 3.
2079 Q5 CRYPTO The message "IMOGUN" was encrypted with a Playfair cipher using
keyword "GALOIS". Decrypt the message.
2079 Q11 CRYPTO Which one is more secure, monoalphabetic cipher or poly alphabetic
cipher? Justify. Using rail fence cipher encrypt the text "LEARNING AND TEACHING ARE
DIFFERENT" using 3 as rails.
2078 Q1 CRYPTO Define CIA triad. State the encryption process of double and triple DES.
What is the task of S-Box in DES ? Discuss with an example.
2078 Q5 CRYPTO Decrypt the message "GVPJ" using Hill cipher taking the key as {Row1 =
3 7, Row2= 5 12}.
2078 Q10 CRYPTO Differentiate between Symmetric and Asymmetric cipher. Encrypt the
message "HELL" using the key "FAIL" using Vernanm cipher.
2076 Q1 CRYPTO Among monoalphabetic and polyalphabetic cipher, which one is more
vulnerable? Justify your statement. Which types of keys are considered weak keys in DES?
Explain the round operation in IDEA.
2076 Q5 CRYPTO Distinguish between stream cipher and block cipher. Encrypt the
message WE ARE IN SAME RACE UNTILL OVER LIVE END using Rail fence cipher using
4 as a number of rails.

Unit 2: Symmetric Ciphers

2082 Q1 CRYPTO Describe the Fiestel Cipher structure. Given the key {2B, 7E, 15, 16, 28,
AE, D2, A6, AB, F7, 97, 66, 01, 02, 03, 04}, compute the first 4 byte of next key after first
iteration, using the following S-Box in AES.
2082 Q6 CRYPTO Explain any two modes of block cipher encryption.
2081 Q1 CRYPTO Let us consider the 4 bits key set as {1100, 1010, 0000, 1111, 0101,
1001) and input text as {1011, 1110, 1011, 1000}. Now trace the first full round operation of
IDEA algorithm.
2081 Q8 CRYPTO Find the multiplicative inverse of polynomial {95} using extended
euclidean Algorithm.
2081 Q11 CRYPTO Describe the different modes of block cipher.
2080 Q2 CRYPTO Write down the encryption and decryption process at 2-DES and 3-DES.
Explain the Fiestal cipher structure. Divide 5x^2 + 4x + 6 by 2x + 1 over GF(7).
2079 Q1 CRYPTO Illustrate the concept of security policy and mechanism with an example.
Differentiate between block cipher and stream cipher(will just memorize some points from
the book) . Explain the process of key expansion in AES.
2079 Q6 CRYPTO How encryption is done using IDEA algorithm.
2078 Q3 CRYPTO Define Galois field with an example. Explain any two modes of block
cipher encryption. Deterimine the quadratic residues of 7.
2078 Q11 CRYPTO Divide 3x^2 + 4x +3 by 5x +6 over GF(7).
2076 Q3 CRYPTO Decrypt the cipher text DRJI with the key [7 8; 11 11] using the Hill cipher.
2076 Q9 CRYPTO Explain the procedure of mix column transformation in AES with an
example.
2076 Q10 CRYPTO Find the GCD of 12 and 16 using the Euclidean algorithm.

Unit 3: Asymmetric Ciphers

2082 Q2 CRYPTO Illustrate the man in middle attack in Diffie - Hellman key exchange
protocol. Assume the prime number be 19 and 10 as its primitive root. Select 5 as private
key and 4 as random integer. Find the cipher text of M = 2 using Elgamal crypto system.
2082 Q7 CRYPTO State Fermat's theorem with example. What is the implication of discrete
logarithm?
2081 Q3 CRYPTO Why do we need discrete logarithm? Illustrate with an example. Consider
a Diffie-Hellman scheme with a common prime p = 13 between user A and user B. Suppose
public key of A is 10 and public key of B is 8. Now determine their private keys and shared
secret key.
2080 Q1 CRYPTO Define discrete logarithms. How key generation, encryption and
decryption is done in RSA. In a RSA cryptosystem, given p=13 and q=7, determine private
key, public key and perform encryption and decryption for the text M="hi".
2080 Q8 CRYPTO How Miller Rabin test is used for primality testing? Show whether the
number 561 passes the test.
2080 Q12 CRYPTO How does meet in middle attack work in Diffie Helman key exchange
protocol? Explain.
2079 Q3 CRYPTO Show that Z5 is a field. John publishes the ElGamal public key (q, a, YA)
=(101, 2, 14). Jane desired to send the secret message CSIT to John. Using the equivalence
A = 0, B=1, ..., Z=25, encrypt the message using John's public key.
2079 Q10 CRYPTO Why do we need discrete logarithm over normal logarithm? Find out
whether 3 is primitive root of 7 or not.
2079 Q12 CRYPTO What is the condition of for two integers, x and y, to be relatively prime?
Find whether 61 is prime or not using Miller-Rabin algorithm.
2078 Q2 CRYPTO Explain the generic model of digital signature process. Consider the two
prime numbers 7 and 19. Select 29 as public key and 41 as private key. Encrypt the plaintext
4 and decrypt the cipher text 3 using RSA.
2078 Q8 CRYPTO Find the value of 7^2019 MOD 13 using Fermat's Little theorem. Define
Euler totient function with an example.
2076 Q2 CRYPTO State Fermat's theorem with an example. Given the prime number p=29
and its primitive root g=8, private key sender with X=9 and random integer K=11, encrypt the
message m=13 using ElGamal cryptosystem.
2076 Q4 CRYPTO Define discrete logarithm. Explain the procedure of sharing the secret key
in Diffie Hellman.
2076 Q10 CRYPTO What is the role of the prime number in the Euler totient Function?

Unit 4: Cryptographic Hash Functions and Digital

Signatures
2082 Q3 CRYPTO List the properties of hash function. Describe the algorithm for SHA-1.
2082 Q8 CRYPTO Describe the working mechanism of digital signature algorithm.
2081 Q2 CRYPTO What is Message Authentication Code? List the operation of computing
digest value in different passes of MD4. Describe Needham Schroeder Protocol
2081 Q12b CRYPTO Write short notes on: b. Properties of hash function.
2080 Q3 CRYPTO What are the applications of hash functions? Discuss how SHA-1
algorithm generates hash value from a given message.
2079 Q2 CRYPTO Describe the properties of hash functions. Discuss how hash value is
generated using SHA-1 algorithm.
2079 Q9 CRYPTO How direct digital signature different from arbitrated digital signature?
How digital signature generation and verification is done using RSA.
2078 Q9 CRYPTO List the properties of hash function. Discuss the first pass of MD4.
2076 Q3 CRYPTO Compare the SHA parameters between SHA-1 and SHA-2 families.
2076 Q6 CRYPTO Define digital signature. Describe the approaches of DSS.
2076 Q11 CRYPTO Write down any two limitations of MAC. What do policy and mechanism
mean in cryptography? Describe with a scenario.

Unit 5: Authentication
2082 Q12 CRYPTO Define authentication system. Discuss about challenge response
system.
2081 Q2 CRYPTO Describe about Needhom-Schroeder protocol.
2081 Q5 CRYPTO Discuss the working mechanism of kerberos protocol.
2080 Q5 CRYPTO Give the formal definition of authentication system. Describe about one
way and mutual authentication system.
2079 Q8 CRYPTO Define challenge response system. Why do we need Kerberos?
2078 Q7 CRYPTO Define authentication system. Illustrate the need of mutual authentication
over one way authentication with an example.

Unit 6: Network Security and Public Key Infrastructure

2082 Q9 CRYPTO List and explain the types of firewall.
2082 Q11 CRYPTO What is digital certificate? Discuss the certificate life cycle.
2081 Q6 CRYPTO What is the use of firewall? How circuit level gateway differs from stateful
inspection firewall?
2081 Q9 CRYPTO What is DoS attack? Discuss about PKI trust model.
2080 Q6 CRYPTO List the stage of certificate life cycle. What are the types of firewalls?
2080 Q9 CRYPTO Show that the set of integers is Ring under addition and multiplication.
2080 Q11 CRYPTO Describe about IPSec. List the five services of PGP.
2079 Q7 CRYPTO Describe the services provided by Pretty Good Privacy protocol to secure
email.
2078 Q4 CRYPTO What does intrusion mean? How the system detect intrusion? List any
four types of firewall.
2078 Q6 CRYPTO Describe the PKI trust model.
2078 Q12 CRYPTO Define SSL protocol. Mention the services provided by PGP.
2076 Q7 CRYPTO What is the task of a firewall? List the elements of X.509.
2076 Q8 CRYPTO Define PKI with its architecture model.
2076 Q12b CRYPTO Write short notes on: b. SSL.

Unit 7: Malicious Logic

2082 Q4 CRYPTO Describe any three types of malicious logic.
2081 Q7 CRYPTO What is intrusion ? Explain any two types of intrusion detection system.
2081 Q12c CRYPTO Write short notes on: c. Virus or Worms.
2080 Q7 CRYPTO What is malicious logic? How zombies are different from trojan horses?
2079 Q4 CRYPTO Differentiate between Trojan horse and virus. Describe any two types of
intruders.
2076 Q8 CRYPTO How does the nature of worms differ from viruses?
2076 Q12a CRYPTO Write short notes on: a. Classes of Intruder.
2076 Q12c CRYPTO Write short notes on: c. DoS Attack.