Scribd
Upload
68 views1 page

Q4

This document contains instructions on using different modular arithmetic theorems and algorithms to solve various congruences, including: 1) Using the extended Euclidean algorithm to find the multiplicative inverse of numbers modulo other numbers. 2) Using Fermat's theorem to find a number congruent to a given number modulo another. 3) Using Euler's theorem to find a number congruent to a large exponent modulo another. 4) Constructing a discrete logarithm table to solve congruences using a given primitive root.

Uploaded by

Vishal C
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
68 views1 page

Q4

This document contains instructions on using different modular arithmetic theorems and algorithms to solve various congruences, including: 1) Using the extended Euclidean algorithm to find the multiplicative inverse of numbers modulo other numbers. 2) Using Fermat's theorem to find a number congruent to a given number modulo another. 3) Using Euler's theorem to find a number congruent to a large exponent modulo another. 4) Constructing a discrete logarithm table to solve congruences using a given primitive root.

Uploaded by

Vishal C
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

1.

Using the extended Euclidean algorithm, find the multiplicative inverse of

(a) 1234 mod 4321

(b) 550 mod 1769

2. Use Fermat’s theorem to find a number ‘x’ between 0 and 72 with ‘x’ congruent to 9794 modulo
73.
3. Use Euler’s theorem to find a number ‘x’ between 0 and 9 such that ‘x’ is congruent to 7 1000
modulo 10.
4. Given 2 as a primitive root of 29, construct a table of discrete logarithms, and use it to solve the
following congruences:

(a) 17x2 ≡ 10 (mod 29)

(b) x2 - 4x - 16 ≡ 0 (mod 29)

(C) x7 ≡ 17 (mod 29)

By Euler's theorem, 7^φ(10) = 7^4 ≡ 1 mod 10. But then 7^1000 = (7^4)^250 ≡ 1^250 = 1 mod
10. So the answer is 1.

You might also like