A Gentle Introduction to Fermat Euler Theorem

We have been commonly using the Euler’s generalized version of Fermat’s little theorem in RSA encryption algorithm. In this post, … More

Official Guide To Fermat’s Little Theorem

Fermat’s Little Theorem states that ap – a is divisible without remainder if p is a prime, and a is … More

RSA is still the most common public key algorithm in cryptography world. Even though, applying the algorithm is very easy, … More

Fermat contributes construction of modern math with well known theorems. Today, we are going to mention the little one. This is … More

Fermat’s last theorem has been waiting almost 350 years to be proven. Now, we can call it theorem but until 90s … More