Explore >> Select a destination
|
You are here 
|
dusted.codes | ||
| | | | |
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. | |
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] The text discusses the fundamentals of Elliptic Curve Cryptography (ECC), focusing on Elliptic Curve Diffie-Hellman (ECDH) and Elliptic Curve Digital Signature Algorithm (ECDSA). It explains how ECDH enables secure key exchange and how ECDSA allows for digital signatures. The text also covers the importance of secure random number generation in ECDSA, highlighting the risks of using a predictable or static secret key, as seen in the PlayStation 3 incident. The discussion includes code examples for ECDH and ECDSA operations and the consequences of poor implementation practices. The text concludes by mentioning future articles on solving discrete logarithms and ECC compared to RSA. | |
| | | | |
sergioprado.blog
|
|
| | | | | In this article, we will learn how asymmetric-key encryption and digital signatures work from a practical perspective. | |
| | | | |
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. | ||
