Explore >> Select a destination
|
You are here 
|
principlesofcryptography.com | ||
| | | | |
susam.net
|
|
| | | | | [AI summary] This article explains why the product of two negative numbers is positive, using mathematical proofs and ring axioms to generalize the rule beyond basic arithmetic. | |
| | | | |
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. | |
| | | | |
blog.lambdaclass.com
|
|
| | | | | Introduction When working with cryptographic applications you need to understand some of the underlying math (at least, if you want to do things properly). For example, the RSA cryptographic system (which was one of the earliest methods and most widely adopted, until it lost ground to better methods, such as | |
| | | | |
www.micah.soy
|
|
| | | A free and open source cryptography playground. | ||
