Explore >> Select a destination
|
You are here 
|
dgroshev.com | ||
| | | | |
blog.basistheory.com
|
|
| | | | | A deep dive into the fundamentals of data encryption, from symmetric vs. asymmetric algorithms to encryption at rest and in transit. | |
| | | | |
notes.volution.ro
|
|
| | | | | About the many types of hash functions, their use-cases, dos and don'ts, with suggestions for currently accepted algorithms. | |
| | | | |
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. | |
| | | | |
blog.cynosureprime.com
|
|
| | | Recovered Percent Total 360,213,049 Usable data 359,005,905 355,886,686 99.13% Unique 116,822,086 113,830,176 97% Salted hashes 68... | ||
