Explore >> Select a destination
|
You are here 
|
blog.lambdaclass.com | ||
| | | | |
www.rareskills.io
|
|
| | | | | This article is explains how to turn a set of arithmetic constraints into Rank One Constraint System (R1CS). | |
| | | | |
ajcr.github.io
|
|
| | | | | Haphazard investigations | |
| | | | |
vitalik.eth.limo
|
|
| | | | | ||
| | | | |
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... | ||
