/explore
|
You are here 
|
www.johndcook.com | ||
| | | | |
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 | |
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] This technical blog post explains the mathematical principles, key generation, and implementation details of Elliptic Curve Cryptography (ECC) covering domain parameters, verifiably random curves, ECDH key exchange, and ECDSA signatures. | |
| | | | |
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... | |
| | | | |
shrik3.com
|
|
| | | [AI summary] The post provides an in-depth mathematical explanation of the RSA algorithm, covering symmetric and asymmetric encryption models, key generation, and proofs of decryption. | ||
