Save trees use e-Question Paper Go green

DOWNLOAD THIS FREE AT www.vturesource.com

18EC744
USN

Seventh Semester B.E. Degree Examination, Feb./Mar. 2022

Cryptography

Time: 3 hrs. Max.

Note: Answer any FIVE full questions, choosing ONE full question from each module.
and or equations written eg. 42-8 $0, will be treated as malpractice

Module-1

e
1 a. Draw the model of symmetric cryptosystem and explain in detail
b. Using Hill Cipher technique encrypt and decrypt the plain money".

c
17 17 5

Using the key. 21 18 21 (12 Marks)

completing your answers, compulsorily draw diagonal cross fines on the remaining blank pages.

2 2 19

OR
2 a. Explain Euclidean algorithm for determining of GCD. Hа= 24140, b = 16762 solve using.
Euclidean algorithm to find GCD (a, b). (08 Marks)

b. Mention the modular arithmetic operation properties and pro ve the same (08 Marks)

c. Find 11 mod 13 using modular Arithmetic. (04 Marks)

Module-2
3 With a diagram, explain fiestal encryption and decryption model. (08 Marks)
2. Any revealing of identification, appeal to evaluator and

a. neat
b. With a neat diagram, explain DES eneryption algorithm. (08 Marks)

c. List the design features of fiestal network (04 Marks)

OR
(08 Marks)
4 a. Explain with a neat diagram AES encryption and decryption process.
(08 Marks)
b. Explain AES key expansion algorithm write the Pseudo code for the same.
c. Deseribe the AES shilt Rows Transformation. (04 Marks)

Module-3
5 a. What are Groups? Explam in detail with respect to its properties (06 Marks)

b. Write a note on finite field of the form GF (P). (06 Marks)

c. Find the additive and multiplicative inverse of GF (8). (08 Marks)

e: 1. On
Important Note: 1.

OR
6 a. State and Theorem. Also find 71* mod 19 using it.
prove Fermat's (08 Marks)
b With suitable explanation prove Euler's Theorem. (07 Marks)
(05 Marks)
Explain discrete logarithms for modular Arithmetic.
w

1 of 2
w
w

ALL BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS ||LAB MANUALS

A Vturesource Go Green initiative
Save trees use e-Question Paper Go green

DOWNLOAD THIS FREE AT www.vturesource.com

18EC744

Module-4
7 a. With a neat diagram, explain public-key cryptosystem secrecy and Authentication
b. Explain the steps involved for encryption and Decryption for RSA Algorithm.
(04
c. Perform encryption using RSA algorithm for p=5, q=11, e-3, m= 9.

OR
(07 Marks)
8 a. Explain Diffic-Hellman key exchange algorithm.
(07 Marks)
b Explain Elliptic curve over real numbers.
(06 Marks)
c. Explain Elliptic curve cryptography.

Module-5
9 a. Write an explanatory note on Liner Feedback shift (10 Marks)

b. Explain the following with necessary diagrams:

i) Generalized Geffe Generator
ii) Threshold Generator
(10 Marks)
iii) Alternating stop and go generator.

OR
10 a nfish and pike Additive Generator.
Explain Additive Generators. Also explain
(10 Marks)

of Gifford. (06 Marks)

b. With a neat diagram, explain the
c Write a short note on A5. (04 Marks)

2 of 2

ALL BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS ||LAB MANUALS

A Vturesource Go Green initiative