Explore >> Select a destination
|
You are here 
|
asecuritysite.com | ||
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] The text provides an in-depth explanation of elliptic curve cryptography (ECC), covering fundamental concepts such as elliptic curves over finite fields, point addition, cyclic subgroups, subgroup orders, and the discrete logarithm problem. It also discusses practical aspects like finding base points, cofactors, and the importance of choosing subgroups with high order for cryptographic security. The text emphasizes that ECC relies on the difficulty of solving the discrete logarithm problem on elliptic curves, which is considered computationally hard and forms the basis for secure cryptographic protocols like ECDH and ECDSA. | |
| | | | |
kndrck.co
|
|
| | | | | Motivation In my quest to understand zero knowledge proofs from the ground up, I've decided to go back to the basics, and really understand how everyday cryptography tools work, not just how to use them. In this post, I'll attempt to explain how and why the diffie hellman key exchange protocol works, along with proofs and a working example. The examples are purely for educational purposes only! Introduction The Diffie-Hellman key exchange protocol is an algorithm that allows two parties to generate a uni... | |
| | | | |
www.johndcook.com
|
|
| | | | | The Bitcoin key mechanism is based on elliptic curve cryptography over a finite field. This post gives a brief overview. | |
| | | | |
sergioprado.blog
|
|
| | | In this article, we will learn how asymmetric-key encryption and digital signatures work from a practical perspective. | ||
