Cryptography20825 marksNumber Theory
State Fermat's theorem with example. What is the implication of discrete logarithm?
State Fermat's theorem with example. What is the implication of discrete logarithm? [5]
Statement: If p is a prime number and a is a positive integer such that gcd(a, p) = 1 (i.e., a is not divisible by p), then: $$a^{p-1} \equiv 1 \pmod{p}$$ An alternative (and equally important) form of Fermat's theorem is: $$a^p \equiv a \pmod{p}$$ This holds for any integer a (even if p divides ...