UNIT II

2MARKS:

1.Find gcd (1970, 1066) using Euclid’s algorithm.

2.Solve 117 mod 13.
3.Define Finite Group.
4.Define Group with an example.
5.Define Ring with an example.
6.Define Field with an example.
7.Does the set of residue classes modulo 3 forms a group
(i) with respect to addition?
(ii) with respect to multiplication?
8.What is an abelian group? give an example
9.What is a cyclic group? give an example
10.Prove that [(a mod n) - (b mod n)] mod n = (a - b) mod n.
11.Differentiate public key and conventional encryption
12.What are the principle elements of a public key cryptosystem?
13.What are roles of public and private key?
14.Specify the applications of the public key cryptosystem?
15.What are the requirements must a public key cryptosystem to fulfil to a secured algorithm?
16.What is a one way function?
17.What is a trapdoor one way function?
18.List four general characteristics of schema for the distribution of the public key.
19.What is a public key certificate?
20.Plan on number of keys that are required by two people to communication via a cipher
21.What are the modes of DES?
22.List the uses of RC4
23.What is optimal Asymmetric Encryption Padding?
24.What are the disadvantages of double DES
25.Is it possible to use the DES algorithm to generate message authentication code? Justify
26.State whether symmetric and asymmetric cryptographic algorithms need key exchange.
27.Brief the strength of Triple DES.
28.Give the significance of hierarchical key control.
29.List the parameters (block size, key size and no of rounds) for the three AES versions.
30.Give the five modes of operations in block cipher.
31.Compare DES and AES.
32.Why is trap door one way function used?
33.Why the middle portion of triple DES is a decryption rather than encryption?
34.Why do some block cipher modes of operation only use encryption while others use both encryption
and decryption?
35.When is encryption scheme unconditionally and computationally secure?
36.If a bit error occurs in the transmission of a cipher text character in 8-bit CFB mode, how far does the
error propagate?
37.Why a large quantity of random keys is undesirable?
38.What are the requirements needed for secure use of Conventional Encryption.
39.List out the parameters of AES.
40.Difference between linear and differential cryptanalysis.
41.List the entities that are to be kept secret in conventional encryption techniques.

10 MARKS

1.Briefly explain Euclid’s Algorithm along with example.

2.Explain in detail about Groups, Rings and Fields.
3.Discuss the following in detail
(i) Modular Exponentiation
(ii) Finite fields
4.Describe Modulo Arithmetic operations and properties in detail.
5.Demonstrate that the set of polynomials whose coefficients form a field is a ring.
6.Write down Triple DES algorithm and explain with neat diagram.
7.Describe the working principles of DES with an example.
8.Discus s in detail the encryption and decryption process of AES.
9.Brief out the encryption and decryption process of DES and depict the general structure. List out the
strength and weakness of the same.
10.Explain in detail about Block cipher design principles.
11Describe in detail the key generation in AES algorithm and its expansion format
12.Explain in detail about the entities in the symmetric cipher model with their requirements for secure
usage of the model.
13.Briefly explain Extended Euclid’s Algorithm and Solve gcd(98, 56) using Extended Euclidean
algorithm.
14.Explain in detail bout Block cipher mode of operation.
15.What do you mean by AES? Diagrammatically illustrate the structure of AES and describe the steps
in AES encryption process with example.
UNIT 3

2MARKS

1.Define Euler’s theorem.

2.What is a primitive root of a number?
3.Define Euler’s totient function.
4.State Fermat’s little theorem
5.Define Coprimes.give an example
6.What is meant by primality testing?
7.Define Chinese remainder Theorem.
8.Explain about asymmetric key cipher.
9.Compare public key and private key algorithm
10.Write about elliptic curve cryptography.
11.Explain attacks of RSA cryptosystem
12.Perform encryption and decryption using RSA Alg. for the following.. P=7; q=11; e=17; M=8
13.User A & B exchange the key using Diffie Hellman algorithm. Assume á=5 q=11 XA=2 XB=3. Find
YA, YB, K.
14.Whether the Diffie Hellman key exchange protocol is vulnerable.Justify
15.Predict differences between Conventional Encryption and Public-Key Encryption.
16.Give the applications of the public key cryptosystem
17.Illustrate the purpose of Diffie Hellman key exchange.
18.Are strong primes necessary in RSA?

10 MARKS

1.(i) Explain in detail about Euler’’s Totient Theorem.

(ii) State and Prove Fermat’s theorem.

2.Explain the key distribution and key management of public key encryption in detail.

3. i. Describe RSA algorithm

ii.Perform encryption and decryption using RSA algorithm for the following: p=7 q=11, e=7, M=9
4.With a neat sketch explain the Elliptic curve cryptography with an example
5.Explain DiffieHellman algorithm and find the secret key shared between user A and user B using
DiffieHellman algorithm for the following q=353; α (primitive root)=3, XA=45 and XB=50
6.Users A and B use the Diffie-Hellman key exchange technique, a common prime q=11 and a primitive
root alpha=7. (i) If user A has private key XA=3.What is A’s public key YA? (ii)If user B has private key
XB=6. What is B’s public key YB?
(iii) What is the shared secret key? Also write the algorithm.

7.Explain in detail about Elgamal Cryptosystems.

8.Explain Chinese Remainder theorem and find X for the given set of congruent equation using CRT
X ≡ 2 (mod 3)
X ≡ 3 (mod 5)
X ≡ 2 (mod 7)
9.Users Alice and Bob use the Diffie-Hellman key exchange technique with a common prime q = 83 and
a primitive root α = 5. i)If Alice has a private key XA = 6, what is Alice’s public key YA? ii) If Bob has a
private key XB = 10, what is Bob’s public key YB? iii)Construct the shared secret key
10.Discuss the ElGamal cryptosystem and elliptic curve cryptosystem.