/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

 dgroshev.com
I don't want to know IPs: encryption in TORRENTDYNE | Dan Groshev
| | ashishpanigrahi.com
Intro to Public-key Cryptography
2.1 parsecs away

Travel
| |
| | rog3rsm1th.github.io
Implementing the Okamoto-Uchiyama cryptosystem in Rust :: Rog3rSm1th - blog
3.1 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.
| | 8yd.no
Scramble ramble: Passwords, salt and hash | H.W. Sanden
2.5 parsecs away

Travel
| | Passwords should be set, not sent - and other things I thought about when someone talked about password-emailing as a natural part of the user registration. I'm no security expert, but that's a big n...
| | www.sjoerdlangkemper.nl
Requirements for iterative password hashing
10.0 parsecs away

Travel
| To securely store passwords they should be hashed with a slow hashing function, such as PBKDF2. PBKDF2 is slow because it calls a fast hash function many times. This blog post explores some properties that the iterations must have to be secure.