Scribd
Upload
59 views

KCS-074 A2

Uploaded by

skw.g.c.dsjs.hg.svv.v
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
59 views

KCS-074 A2

Uploaded by

skw.g.c.dsjs.hg.svv.v
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/ 1

B.

Tech(CSE-AI) VII Sem


Cryptography & Network Security (KCS-074)
Assignment-2
Attempt all the questions.

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


2. Define a Group and Ring. Prove that the order of any subgroup of finite group divides
the order of the group.
3. Explain AES algorithm. What is the difference between the AES encryption algorithm
and the DES algorithm.
4. State and prove Fermat’s theorem. Use Fermat theorem to find a number ‘a’ between 0
and 72 with a≡9794 mod 73.
5. Describe RSA algorithm in detail. Calculate the private key of A wherein RSA
cryptosystem a particular A uses two prime numbers p = 13 and q =17 to generate her
public and private keys. Let the public key of A is 35.
6. Discuss the design of S-Box of AES. How it differs from the S-Boxes of DES.
7. In a public key system using RSA, you intercept the cipher text C=8 sent to a user
whose public key is e=13, n=33. What is the plain text M?
8. Define Euler’s Totient Function. Prove that, ɸ(pq) = (p-1)(q-1), where p and q are prime
numbers.
9. What do you understand by Chinese Remainder Theorem? Solve the following
congruent equations by Chinese remainder theorem:
i. X ≡ 2 mod 3
ii. ii. X ≡ 3 mod 5
iii. iii. X ≡ 2 mod 7

You might also like