/explore
|
You are here 
|
rot256.dev | ||
| | | | |
www.johndcook.com
|
|
| | | | | About how many items can you expect to hash with a secure hash function before risking into collisions? Here's a rule of thumb and a proof. | |
| | | | |
www.jeremykun.com
|
|
| | | | | So far in this series we've seen elliptic curves from many perspectives, including the elementary, algebraic, and programmatic ones. We implemented finite field arithmetic and connected it to our elliptic curve code. So we're in a perfect position to feast on the main course: how do we use elliptic curves to actually do cryptography? History As the reader has heard countless times in this series, an elliptic curve is a geometric object whose points have a surprising and well-defined notion of addition. | |
| | | | |
ordep.dev
|
|
| | | | | [AI summary] A technical presentation transcript explaining the concept of Merkle Trees, their history, implementation in Elixir, and applications in cryptography and distributed systems. | |
| | | | |
suckless.org
|
|
| | | [AI summary] The article critiques systemd, a Linux init system, for its complexity, bloat, and negative impact on system design and user control, highlighting its controversial role in modern Linux distributions. | ||
