Explore >> Select a destination
|
You are here 
|
blog.cryptohack.org | ||
| | | | |
kndrck.co
|
|
| | | | | Motivation RSA (Rivest-Shamir-Adleman) is one of the first public-key cryptosystems and is widely used for secure data transmission. In such a cryptosystem, the encryption key is public and is different from the decryption key which is kept secret. If I wanted to comprehend zero knowledge proofs, then understanding the grand-daddy of public-key cryptosystems is a must. Background Maths Exponential Rules 1 $$ \begin{align} \label{eq:exponent_rule} g^{a-b} &= \dfrac{g^a}{g^b} \newline g^{a+b} &= g^a g^b \n... | |
| | | | |
blog.lambdaclass.com
|
|
| | | | | Elliptic curves (EC) have become one of the most useful tools for modern cryptography. They were proposed in the 1980s and became widespread used after 2004. Its main advantage is that it offers smaller key sizes to attain the same level of security of other methods, resulting in smaller storage | |
| | | | |
unorde.red
|
|
| | | | | [AI summary] This article explains the Diffie-Hellman key exchange algorithm, its mathematical foundation in discrete logarithm problems, and its security implications in modern cryptography. | |
| | | | |
blog.0xbadc0de.be
|
|
| | | |||
