Applications of Fermat's Little Theorem

Fermat's Little Theorem that is used to simplify the progression of converting a power of a number to a prime modulus is known as the most crucial theorem in elementary number theory. The credit of this theorem goes to Pierre de Fermat. This theorem is an exclusive situation of Euler's the...

Full description

Saved in:
Bibliographic Details
Published in:Turkish journal of computer and mathematics education 2023-01, Vol.14 (3), p.209-214
Main Authors: Samandari, Noormal, Nazari, Nazar Mohammad, Olfat, Janat Akbar, Rafi, Rafiullah, Azizi, Ziaulhaq, Ulfat, Wali Imam, Waqar, Ikramullah, Zahirzai, Mansoor, Niazi, Mohammad Jawad
Format: Article
Language:English
Subjects:
Congruences
Cryptography
Number theory
Theorems
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Fermat's Little Theorem that is used to simplify the progression of converting a power of a number to a prime modulus is known as the most crucial theorem in elementary number theory. The credit of this theorem goes to Pierre de Fermat. This theorem is an exclusive situation of Euler's theorem and is pretty helpful in application of number theory such as congruence relation modulo n and public-key cryptography. Compared to Fermat's Last theorem which notes that when n > 2, xn + yn = zn has no solutions x.y.z ∈ N .(Riehm & Dudley), Fermat's this theorem is titled as "little". Fermat's Last Theorem remained unsolved for several years in the field of mathematics. Fermat described this theorem some 350 years ago and Andrew Wiles proved it in 1995. It is simple to prove Fermat's Little Theorem, but it has a wide implication for cryptography.
ISSN:1309-4653