/explore
|
You are here 
|
algassert.com | ||
| | | | |
quantumcomputinginc.com
|
|
| | | | | ||
| | | | |
www.kuniga.me
|
|
| | | | | NP-Incompleteness: Introduction to quantum computing and the Deutsch-Jozsa Algorithm | |
| | | | |
thomasvilhena.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... | ||
