/explore
|
You are here 
|
dusty.phillips.codes | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
www.jeremykun.com
This post assumes working knowledge of elementary number theory. Luckily for the non-mathematicians, we cover all required knowledge and notation in our number theory primer. So Three Thousand Years of Number Theory Wasn't Pointless It's often tough to come up with concrete applications of pure mathematics. In fact, before computers came along mathematics was used mostly for navigation, astronomy, and war. In the real world it almost always coincided with the physical sciences. |
|
| | | | | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
jbp.io
[AI summary] This post explains a security demo using Intel SGX enclaves to harden password hashing by creating a shared 'region' of encrypted keys, preventing offline database attacks. |
|
| | | |||
