/explore
|
You are here 
|
www.johndcook.com | ||
| | | | |
kndrck.co
|
|
| | | | | Motivation RSA (Rivest-Shamir-Adleman) is one of the first public-key cryptosystems and is widely used for secure data transmission. In such a cryptosystem, the encryption key is public and is different from the decryption key which is kept secret. If I wanted to comprehend zero knowledge proofs, then understanding the grand-daddy of public-key cryptosystems is a must. Background Maths Exponential Rules 1 $$ \begin{align} \label{eq:exponent_rule} g^{a-b} &= \dfrac{g^a}{g^b} \newline g^{a+b} &= g^a g^b \n... | |
| | | | |
shrik3.com
|
|
| | | | | [AI summary] The post provides an in-depth mathematical explanation of the RSA algorithm, covering symmetric and asymmetric encryption models, key generation, and proofs of decryption. | |
| | | | |
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. | |
| | | | |
cronokirby.com
|
|
| | | - Read more: https://cronokirby.com/posts/2021/04/constant-time-big-numbers-introduction/ | ||
