Explore >> Select a destination

You are here

 cronokirby.com
Introducing Nimotsu - Cronokirby
| | www.jeremykun.com
Elliptic Curve Diffie-Hellman || Math ? Programming
7.9 parsecs away

Travel
| | 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.
| | words.filippo.io
Post-quantum Cryptography for the Go Ecosystem
10.3 parsecs away

Travel
| | filippo.io/mlkem768 is a pure-Go implementation of the post-quantum key exchange mechanism ML-KEM-768 optimized for correctness and readability.
| | hardenedvault.net
Vault1317 protocol: a modern approach for metadata protection with deniability
10.1 parsecs away

Travel
| | Open source platform security
| | mfbmina.dev
RSA in Ruby for beginners - mfbmina.dev
57.7 parsecs away

Travel
| Introdução RSA is a public/private encryption algorithm and it is based on the difficulty of the factorization of the product of two large prime numbers. It was named after its creators Rivest, Shamir, and Adleman. It is an expensive algorithm, computationally speaking, and because of this, it is not common to use it directly, but it is still widely used in the market and is one of the most important encryption algorithms. As an example, OpenSSL implements this algorithm for generating keys and it is com...