Explore >> Select a destination
|
You are here 
|
blog.lambdaclass.com | ||
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] A technical blog post explaining elliptic curves over finite fields, covering modular arithmetic, point addition algorithms, cyclic subgroups, and the discrete logarithm problem in the context of cryptography. | |
| | | | |
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... | |
| | | | |
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. | |
| | | | |
rareskills.io
|
|
| | | Elliptic Curves over Finite Fields What do elliptic curves in finite fields look like? It's easy to visualize smooth elliptic curves, but what do elliptic curves over a finite field look like? The following is a plot of $y² = x³ + 3 \pmod {23}$ Because we only allow integer inputs (more specifically, finite field... | ||
