Explore >> Select a destination
|
You are here 
|
dusted.codes | ||
| | | | |
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. | |
| | | | |
dusty.phillips.codes
|
|
| | | | | The venerable RSA public key encryption algorithm is very elegant. It requires a basic understanding of modular arithmetic, which may sound scary if you havent studied it. It reduces to taking the remainder after integer long division. The RSA Wikipedia article describes five simple steps to generate the keys. Encryption and decryption are a matter of basic exponentiation. Theres no advanced math, and its easy to understand their example of working with small numbers. | |
| | | | |
www.imperialviolet.org
|
|
| | | [AI summary] The article explains the mathematical foundations of elliptic curves, their group structure, and their application in cryptography, particularly the Diffie-Hellman key agreement protocol, while also discussing implementation challenges in finite fields. | ||
