/explore
|
You are here 
|
www.lapsedordinary.net | ||
| | | | |
theniceweb.com
|
|
| | | | | ||
| | | | |
kndrck.co
Motivation In my quest to understand zero knowledge proofs from the ground up, I've decided to go back to the basics, and really understand how everyday cryptography tools work, not just how to use them. In this post, I'll attempt to explain how and why the diffie hellman key exchange protocol works, along with proofs and a working example. The examples are purely for educational purposes only! Introduction The Diffie-Hellman key exchange protocol is an algorithm that allows two parties to generate a uni... |
|
| | | | | ||
| | | | |
blog.intothesymmetry.com
tl;dr Mozilla Firefox prior to version 72 suffers from Small Subgroups Key Recovery Attack on DH in the WebCrypto 's API. The Firefox's te... |
|
| | | | | ||
| | | | |
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. |
|
| | | |||
