Scribd
Upload
31 views

4-Modular Arithmetic, Euclidean Algorithm & Assignment-1-09-01-2024

This document contains an assignment on cryptography and network security. It includes 21 questions across two sections - theory and problems. The theory section covers topics like prime numbers, modular arithmetic, block vs stream ciphers, DES and AES algorithms. The problems section tests concepts like Euclid's algorithm, Miller-Rabin primality test, Fermat's and Euler's theorems, Chinese Remainder Theorem and cryptography problems.

Uploaded by

utkarsh.tyagi2021
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

4-Modular Arithmetic, Euclidean Algorithm & Assignment-1-09-01-2024

This document contains an assignment on cryptography and network security. It includes 21 questions across two sections - theory and problems. The theory section covers topics like prime numbers, modular arithmetic, block vs stream ciphers, DES and AES algorithms. The problems section tests concepts like Euclid's algorithm, Miller-Rabin primality test, Fermat's and Euler's theorems, Chinese Remainder Theorem and cryptography problems.

Uploaded by

utkarsh.tyagi2021
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Cryptography and Network Security

Assignment-1 ( Due 23 Jan 2024)

A) Theory: 4marks
1. Define the following.
i. Prime & relative prime
ii. Modulo arithmetic & residue
iii. GCD
iv. Primitive Root; Find primitive root of 353
v. Discrete log
2. Define the following.
i. Block Cipher Vs Stream Cipher
ii. Confusion & Diffusion
iii. Substitution & Permutation
iv. DES vs AES
v. Linear Cryptanalysis vs Differential cryptanalysis
vi. Man in the middle attack
vii. Brute force attack
3. Discuss the flow of DES algorithm. Describe single round function in detail.
4. DES has the following functionalities. Explain the comparable functions in AES.
a) XOR of sub key material with the input to the function
b) F function
c) Permutation
d) Swapping of halves of the block.
e) Weakness of DES

B) Problems: 6 marks ( Marks Not for Answers)


5. Find modulo: 255 mod 7; -100 mod 7; Find residue of 6 when n=8
6. Depict Euclid’s alg. Find GCD(21,300), gcd of (2740,1760),GCD(1160718174, 316258250)
7. Write Miller Rabin Primality testing alg. Test whether 1973 is a valid prime.
8. State Little fermat’s theorem. Find 321mod 11 ; 117 mod 13;
9. State Euler’s theorem. Find GCD( 1970,1066) using Eulers.
10. Define Euler’s Totient function. Find Ø(35), Ø(37), ( 100) and  ( 80)
11. State Chinese Reminders Theorem and Solve.
a) X ≡ 2 (mod 3) X ≡ 3 (mod 5) X ≡ 2 (mod 7)
b) X ≡ 1 (mod 5) X ≡ 2 (mod 7) X ≡ 3 (mod 9) X ≡ 4(mod 11)
12. Solve i) x2 ≡ 36 (mod 77); ii) x= 162 mod 23
ONLY for S-graders(10marks)

13. Divide (HAPPY)26 by (SAD)26. Find quotient, Dividing (11001001) by (100111)


find remainder and what is output In base 26 for multiplication of YES by NO
14. Assume that a = 255 and n = 11. We can find q = 23 and r = 2 .
Calculate q and r for a= -255 and n=11
15. Use Euler's Theorem to find a number a between 0 and 9 such that a is congruent
to71000 modulo 10.
16. What are the last two digits of 4919?
17. A Box contains gold coins. If the coins are equally divided among three friends, two
coins are left over, If the coins are equally divided among five friends, three coins are
left over If the coins are equally divided among seven friends, two coins are left over.
If the box holds smallest number of coins that meets these conditions, how many
coins are there?
18. (i) Alice chooses 173 and 149 as two prime numbers and 3 as key . Check whether
the chosen prime numbers are valid or not?
ii) Find whether 19 is Prime or not using Fermat’s theorem; ( consider a=3)
(iii) Prove that Euler’s Totient value of any prime number (p) is p-1 and the Euler’s
Totient value of the non-prime (n) is (p-1)(q-1) where p and q are prime factor of n.
(iv) Bob chooses 3 and 7 are two prime numbers. He encrypts the given message by
mapping A = 1, B = 2, C = 3.., Z = 26. Find atleast two problems in his implementation.
19. Find gcd (24140, 16762), gcd (11970, 10666) using Euclid’s alg & Euler’s theorem.
20. Find 1113 mod 53; Solve x511 mod 17
21. A)Explain Random bit generation and RC4 algorithm.
B) Discuss in detail about IDEA algorithm with neat sketch.

Note: Include Qn no 3 & 4 also .


***

You might also like