Scribd
Upload
7 views

15XT52-4

Uploaded by

ushanandhini.2k3.tup
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
7 views

15XT52-4

Uploaded by

ushanandhini.2k3.tup
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/ 2

3978

No of Pages : 2 Course Code : 15XT52

Roll No:
(To be filled in by the candidate)

PSG COLLEGE OF TECHNOLOGY, COIMBATORE - 641 004

SEMESTER EXAMINATIONS, NOVEMBER 2019

MSc - THEORETICAL COMPUTER SCIENCE Semester : 5

15XT52 COMPUTATIONAL NUMBER THEORY AND CRYPTOGRAPHY

Time : 3 Hours Maximum Marks : 100


INSTRUCTIONS:
1. Answer ALL questions. Each question carries 20 Marks.
2. Subdivision (a) carries 3 marks each, subdivision (b) carries 7 marks each and
subdivision (c) carries 10 marks each.
3.Course Outcome Qn.1 Qn.2 CO2. Qn.3 CO 3 Qn.4 CO.4 Qn.5 CO5
CO1
Table : …… ..… 3... ...… 555
. …. …… ….
1. a) There are only finite number of primes. Comment .on this statement.
b) i) Is it possible to find the remainder when 1! + 2! + 3! + ⋯ + 100! is divided by 15?
Justify your answer. (3)
ii) Find all the solutions of 91𝑥 ≡ 119 (𝑚𝑜𝑑 28). (4)
c) i) If 𝑎 and 𝑏 are any two positive integers and 𝑟 is the remainder when 𝑎 is divided
by 𝑏 then prove that the 𝐺𝐶𝐷 (𝑎, 𝑏) = 𝐺𝐶𝐷 (𝑏, 𝑟). Use the above result to find
𝑑 = 𝐺𝐶𝐷(161, 28) and express d as a linear combination of 161 and 28.
(OR)
ii) What do you mean by primitive root? For what value(s) of 𝑛 does the group <
𝑍𝑛∗ ,×> have primitive root? Prove that 𝐺 = < 𝑍7∗ ,×> forms a group. Compute the
order of each element in the group 𝐺. Does 𝐺 form a cyclic group? If so, what are
the possible generators? Are those generators can be primitive roots? ?Justify
your answer.
2. a) Some of the real time situations are S1: A student breaks into a professor’s office to
obtain a copy of the next day’s test; S2: A student gives a check for $ 10 to buy a
used book. Later she finds that the check was cashed for $100; and S3: A student
sends hundreds of e-mails per day to another student using a phony return e-mail
address. Some of the types of security attacks are A1: Snooping; A2: Replay attack;
A3: Masquerading; A4: Modification attack; and A5: Denial of service attack. Match
each real time situations to the corresponding security attacks.
b) i) What is the pattern in the ciphertext of a one-time pad if the plaintext is made of
all 1’𝑠? (3)
ii) Annotate any three possible attacks on DES algorithm. (4)
Page No : 1
3978

No of Pages : 2 Course Code : 15XT52

c) Write a short note on the following: Cryptanalytic attack, Non- Cryptanalytic attack,
Ciphertext only attack, Known plaintext attack, Chosen plaintext attack, Chosen
ciphertext attack.
3. a) What do you mean by quadratic residue? Test whether 5 is a quadratic residue
modulo 13.
b) i) Does the RSA encryption/decryption algorithm robust against factorization
attack? Justify your answer. (3)
ii) State and prove the necessary and sufficient condition for quadratic residue. (4)
c) i) Explain ElGamal key generation, encryption and decryption processes with its
proof of correctness. Also detail the possible attacks on ElGamal scheme.
(OR)
ii) Write Miller-Rabin algorithm for primality test. Prove that Miller-Rabin algorithm
for composite is a yes-biased Monte-Carlo algorithm. Using it, check whether 561
is a prime or not with the base 2.
4. a) What are the criteria for a good cryptographic hash function?
b) i) Assume we have a very simple message digest. The message digest is just one
number between 0 and 25. The digest is initially set to 0. The cryptographic hash
function adds the current value of the digest to the value of the current character
(between 0 and 25). Addition is in modulo 26. What is the value of the digest if
the message is “HELLO”? Why is this digest not secure? (3)
ii) Illustrate that how a digital signature can be used to achieve the security services
such as message authentication, message integrity and nonrepudiation. (4)
c) Explain Digital Signature Standard(DSS) algorithm in detail with its proof of
correctness. Suppose Alice chooses 𝑝 = 8081 and 𝑞 = 101. Alice selects 𝑒0 = 3,
calculates 𝑒1 = 6968 and chooses 𝑑 = 61 and computes 𝑒2 = 2038. For ℎ(𝑀) =
5000 and 𝑟 = 6, find the signature (𝑆1 , 𝑆2 ) using DSS algorithm.
5. a) In what way entity authentication differ from message authentication?
b) i) Diffie-Hellman key exchange protocol is vulnerable to man-in-the-middle attack.
Justify this statement. (3)
ii) What do you mean by zero-knowledge authentication? Does Fiat-Shamir protocol
achieve zero-knowledge authentication? Justify your answer. (4)
c) What are the advantages of challenge response protocol over the password based
authentication? Describe the challenge response protocols for both unidirectional and
bidirectional using symmetric-key cipher, asymmetric-key cipher and digital
signature.

FD/JU /END/

Page No : 2

You might also like