Explore >> Select a destination
|
You are here 
|
dgroshev.com | ||
| | | | |
8yd.no
|
|
| | | | | 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... | |
| | | | |
quantumloom.in
|
|
| | | | | A simple guide to how cryptography keeps your digital stuff safe-from secret codes to secure messages. | |
| | | | |
rog3rsm1th.github.io
|
|
| | | | | 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. | |
| | | | |
www.jeremykun.com
|
|
| | | Last time we saw the Diffie-Hellman key exchange protocol, and discussed the discrete logarithm problem and the related Diffie-Hellman problem, which form the foundation for the security of most protocols that use elliptic curves. Let's continue our journey to investigate some more protocols. Just as a reminder, the Python implementations of these protocols are not at all meant for practical use, but for learning purposes. We provide the code on this blog's Github page, but for the love of security don't actually use them. | ||
