Explore >> Select a destination
|
You are here 
|
blog.cr.yp.to | ||
| | | | |
www.lightbluetouchpaper.org
|
|
| | | | | ||
| | | | |
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. | |
| | | | |
keymaterial.net
|
|
| | | | | One weird hobby of mine is reasonable properties of cryptographic schemes that nobody promised they do or don't have. Whether that's invisible salamanders or binding through shared secrets, anything that isn't just boring IND-CCA2 or existential unforgeability is just delightful material to construct vulnerabilities with. Normally, with a signature scheme, you have the public key... | |
| | | | |
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. | ||
