Explore >> Select a destination
|
You are here 
|
www.imperialviolet.org | ||
| | | | |
blog.cr.yp.to
|
|
| | | | | [AI summary] The text discusses the complexities and security concerns of the ECDSA (Elliptic Curve Digital Signature Algorithm) compared to more modern signature systems like Ed25519. It highlights issues such as the lack of constant-time implementations in ECDSA, the importance of secure random number generation (RNG) for generating nonces (k), and the vulnerabilities that can arise from poor RNG practices. The text also compares ECDSA with alternatives like Ed25519, which uses deterministic methods for generating k, thus avoiding the need for an RNG and enhancing security. Additionally, it touches on the design of secure RNGs, the role of hash functions in generating k, and the potential for attacks due to non-constant-time implementations and poor random... | |
| | | | |
educatedguesswork.org
|
|
| | | | | [AI summary] The transition to post-quantum cryptography (PQC) in TLS and other protocols is a complex and challenging process. While hybrid approaches combining classical and PQC algorithms are currently the most practical, the long-term goal is to adopt pure PQC. The transition will require significant coordination and may be slow due to the diversity of systems involved. However, TLS is better positioned for this transition due to its algorithm agility. The biggest risks include the potential for a sudden quantum computing breakthrough (CRQC) and the difficulty of updating older systems, particularly IoT devices. Overall, the transition is necessary but will take time and effort. | |
| | | | |
tahoe-lafs.org
|
|
| | | | | ||
| | | | |
www.jeremykun.com
|
|
| | | This article was written by my colleague, Cathie Yun. Cathie is an applied cryptographer and security engineer, currently working with me to make fully homomorphic encryption a reality at Google. She's also done a lot of cool stuff with zero knowledge proofs. In previous articles, we've discussed techniques used in Fully Homomorphic Encryption (FHE) schemes. The basis for many FHE schemes, as well as other privacy-preserving protocols, is the Learning With Errors (LWE) problem. | ||
