Scribd
Upload
12 views

CNS Unit 3 Assignment

The document contains 16 questions related to modular arithmetic and number theory topics like addition and multiplication tables modulo values, finding solutions to congruences, applying Fermat's theorem, the extended Euclidean algorithm, Euler's totient function, and the Chinese Remainder Theorem.

Uploaded by

yakshpatel1653
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
12 views

CNS Unit 3 Assignment

The document contains 16 questions related to modular arithmetic and number theory topics like addition and multiplication tables modulo values, finding solutions to congruences, applying Fermat's theorem, the extended Euclidean algorithm, Euler's totient function, and the Chinese Remainder Theorem.

Uploaded by

yakshpatel1653
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

KADI SARVA VISHWA VIDHYALAYA

LDRP INSTITUTE OF TECHNOLOGY AND RESEARCH, GANDHINAGAR


Computer Engineering Department
Semester: 6 Term: Dec- 2023 to Apr- 2024

Cryptography and Network Security


(CE603NNN)
Assignment –3
1. Write out the addition and multiplication tables modulo 11.
How many values have additive inverses?
How many values have multiplicative inverses?
2. Write out the addition and multiplication tables modulo 12.
How many values have additive inverses?
How many values have multiplicative inverses?
3. For each of the following, find n:
1. 5 + 7 ≡ n mod 8
2. 5 ∙ 7 ≡ n mod 8
4. Find a number n such that 2 ∙ n ≡ 1 mod 5.
5. Find a number n such that 10 ∙ n ≡ 1 mod 13.
6. Find a number which is congruent to 2 mod 3 and congruent to 3 mod 4.
7. Find a number which is congruent to 3 mod 5 and congruent to 5 mod 7.
8. Define congruent modulo. Also Find integer x such that
1. 5x≡4 (mod 3)
2. 7x≡6 (mod 5)
9. State and Prove Fermat’s theorem.
10. Describe and illustrate the Chinese Reminder Theorem.
11. Find the gcd of following number pairs using Euclidean algorithm.
1. 42823 and 6409
2. 7469 and 2464
3. 54321 and 9876
4. 1970 and 1066
12. Find the multiplicative inverse of following using extended Euclidean algorithm.
1. 50 mod 71
2. 43 mod 64
13. Find a solution to following using fermat’s theorem.
1. x12 ≡ 3 mod 11.
2. 3201 mod 11.
3. x85 ≡ 6 mod 29 (x should be between 0 to 28)
14. Explain Euler’s totient function.
15. Find the results of following.
1. ɸ(99) 2. ɸ(39) 3. ɸ(64) 4. ɸ(43)
2. Prove that if a number n is a product of two prime numbers p and q, then
ɸ(n) = (p-1)∙(q-1)
16. Solve the following simultaneous congruence using Chinese Remainder Theorem to find
the value of a.
1. a ≡ mod 3
2. a ≡ mod 5
3. a ≡ 2 mod 7

You might also like