/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 imapenguin.com
A Gentle Introduction to LFSRs | Imapenguin
| | www.jeremykun.com
Elliptic Curve Diffie-Hellman | Math Programming
6.8 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.
| | fernandocorreia.dev
Learning Golang: Random numbers | Fernando Correia's Blog
3.8 parsecs away

Travel
| | This is part 23 of my journey learning Golang. Random number generators For some kinds of programs, like simulations, games, or test code, it is useful to be ...
| | timnash.co.uk
Nothing is truly random by Tim Nash
6.7 parsecs away

Travel
| | A deep dive into how WordPress's wp_rand() works, what a CSPRNG is, and why some warnings about it are misplaced.
| | rog3rsm1th.github.io
Implementing the Okamoto-Uchiyama cryptosystem in Rust :: Rog3rSm1th - blog
20.2 parsecs away

Travel
| The Okamoto-Uchiyama cryptosystem is a semantically secure, asymmetric encryption algorithm. It was first introduced in 1998 by Tatsuaki Okamoto and Shigenori Uchiyama. The method is additive-homomorphic, which means that the plaintexts are added by multiplying two ciphertexts. It is therefore not necessary to decrypt the ciphertexts in order to be able to operate on the plaintexts. While searching for implementations of this algorithm on github, I realized that there were only two rough implementations.