State fermat’s little theorem (FLT) and Euler’s theorem. Illustrate with an example how FLT can be used to find modular inverse.

Mumbai university > Electronics and telecommunication Engineering > Sem 7 > Data compression and Encryption

Marks: 4

Years: May 2016

Fermat’s theorem:

It states that if p is a prime no. and a is a positive integer not divisible by p then

ap-1 = I mod p

If p is a prime no. and n is a positive integer not divisible by p then according to the modular arithmetic the …