F 6594 (Pages:2)

D"D.M.C.A* DEGR,EE trXAMINATION, NOVEI\iIBER 2O1B

Scventh Sernester
MATHEMATICAL FO{JNDATION OF COMFUTER SECURITY
(20L4 Admission onwards)

[Re gul arlSupplement ary]

Time : Three Hours Maximum:75 Marks

Part A
Arusruer aruy ten questions"
Each. qwestioru carcies 3 marhs.

L. Evaiuate m:=, (,' - *)

2. Find the next two elements of the sequence l, t,2, 5, L4, 42 ....
3. Define Fermat numbers with examples.
4. Compute gcd (823,2939) using Euclid's algorithm.
5. Find the LCM of 168 and 180 using their canonical decompositions.
6. State the divisibility tests for 9 and 11.
7. Give the remainder when 1r. + 2! + .... 100! is divided by 15.
8. State Dirichlet's theorem using the cong::uence relation.
9. Verify that the linear system 2x +y = 4 (mod 13) and 3x + 4y = 5 (mod 13) has a unique solution
modulo 13.
10. Compute OrdrrS and Ordrr7.

11. Solve the quadratic congruence 3r2 - 4x + 7 = 0 (mod l-3).

12. Evaluate the Legendre symbols (- 4141).
(10x3=30marks)
Part B
Answer all questions.
_ Each question caruies I marks.

L3. (a) State the principle of mathematical induction and prove V n e N,

\2 +22 +32 +...n2 =ln(n+t)(Zn.+l)]/O usinginduction.

Or
(b) What are polygonal numbers ? Discuss the methods to generate them in detail.
Turn over
F 6594 (Pases : 2) Reg. No...
Name...."..

D"D.M.C.A.. DEGREE EXAMTNATTON, NOVEUTBER 20I.8

Seventh Semester
MATHEMATICAT, F'OUNDATION OF COMFUTER SECUR,ITY
(20L4 Admission onwards)

[Regular/Supplement aryl
Time : Three Hours Maximum : 75 Marks
Fart A
Ansutet" any tem" questions"
Each. qwestion carcies 3 marks.

1.. Evaiuate trl:=, (,' - *).

2. Find the next two elements of the sequence t, 1,2, 5, L4, 42 ....
3. Define Fermat numbers with examples.
4. Compute gcd (823,2939) using Euclid's algorithm.
5. Find the LCM of 168 and 1-80 using their,canonical decompositions.
.. 6. Siate the divisibility tests for 9 and 11.
7. Give the remainder when 1! + 2! + .... 100! is divided by 15.
8. State Dirichlet's theorem using the congruence relation.
9. Veriff that the linear system 2x +y: 4 (mod 13) and 3x + 4y : 5 (mod13) has a unique solution
modulo 13.
10. Compute Ordt S ar.d Ordrr7.

11. Solve the quadratic congruence 3x2 - 4x + 7 = 0 (mod 13).

12. Evaluate the Legendre symbols (- 4l4l).

(10x3=30marks)
Part B
Answer all questions.
_ Each question carcies 9 marks.
13. (a) State the principle of mathematical induction and prove V n e N,

12 +22 + 32 + ... ,2 =ln Qt + t) (2n + t))lA using induction.

Or
(b) What are polygonal numbers ? Discuss the methods to generate them in detail.
Turn over
 F 6594

14. (a) State and prove Lame's theorem.

Or
(b) worth 5 coins, a hen 3 eoins, and three chicks together one coin, how many cocks,
nf a eock is
hens and etricks totatrling 100, ean be bought for 100 coins ?
l-5. (a) (i) State and prove Chinese rernainder theorem.
(ii) Give a brief overview on Cryptology.
(5+4=9marks)
Or
(b) Explain encryption and decryption using hill cipher with 2 x 2 i<ey matrix.

L6. (a) State Lucas theorem and prove that ru = 1201 is a prime.

(b) (i) Solve 8x5 =3 (mod 13) using indices.

(ii) Write a short note on the signifrcance of primitive roots in cryptography.

(5+4=9marks)
L7. (a) State the 1aw ofquadratic reciprocity and prove.
Or
(b) Evaluate the Jacobi symbols (55/273) and (364/935).
[5x9=45marks]