We have been commonly using the Euler’s generalized version of Fermat’s little theorem in RSA encryption algorithm. In this post, … More
Category: Cryptography
Twisted Edwards Curves for Digital Signatures
Edwards curves are pivotal ones in crypto field. The normal form Harold Edwards studied was x2 + y2 = c2 + … More
A Gentle Introduction to Edwards-curve Digital Signature Algorithm (EdDSA)
Elliptic curves are the most challenging topic in crypto field whereas Edwards curves are the hottest topic among elliptic curves. Elliptic … More
A Gentle Introduction to Edwards Curves
In 2007, Harold Edwards introduced a new form for elliptic curves. Thereafter, people interestingly named this form as Edwards Curves. Nowadays, … More
A Step by Step Hill Cipher Example
Hill cipher is a kind of a block cipher method. Actually, it was the first one appearing in the history. … More
Elliptic Curve ElGamal Encryption
We often use elliptic curves for public key cryptography tasks such as key exchange and digital signature tasks. Because these … 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
The Math Behind RSA Algorithm
RSA is still the most common public key algorithm in cryptography world. Even though, applying the algorithm is very easy, … More
Unofficial Guide to Fermat’s Little Theorem
Fermat contributes construction of modern math with well known theorems. Today, we are going to mention the little one. This is … More
A Step By Step Bitcoin Address Example
A money transfer transaction must include sender and receiver account information and transaction amount. On the other hand, a bitcoin … More
