Circom-ecdsa optimizations - General - zk research
ECC Operations Optimizations in R1CS This note was originally written in collaboration with Wen-Ding Li in March 2022 Our goal is to build groth16 circuits that can verify claims involving ECDSA algorithms. To do this, we want to implement R1CS circuits for elliptic curve operations (particularly on secp256k1) with a small number of constraints. Suppose the scalar field of the curve y^2 = x^3 + b is F_q where q has 256 bits and the baby Jubjub prime is p which is slightly less 254-bit. Ch...
Circom-ecdsa optimizations - General - zk research Circom-ecdsa optimizations General gubsheep October 5, 2022, 6:37am #1 ECC Operations Optimizations in R1CS This note was originally written in collaboration with Wen-Ding Li in March 2022 Our goal is to build groth16 circuits that can verify claims involving ECDSA algorithms. To do this, we want to implement R1CS circuits for elliptic curve operations (particularly on secp256k1) with a small number of constraints. Suppose the scalar field of the curve y^2 = x^3 + b is F_q where q has 256 bits and the baby Jubjub prime is p which is slightly l
related reading
- 0xPARC0xparc.org
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- 370.pdfeprint.iacr.org
- ZK-Friendly Hash Functions | Zellic — Researchzellic.io
- Zinc+: SNARKs for Polynomial Ringseprint.iacr.org
- Math & Engineeringxn--2-umb.com
- Collaborative zkSNARKseprint.iacr.org
- The Spartan zkSNARK framework - Alin Tomescualinush.github.io
- Math & Engineeringxn--2-umb.com
- thesis.pdfaayushg.com
- WHIR: Reed–Solomon Proximity Testing with Super-Fast Verificationeprint.iacr.org
- Variants of KZG: Part III, Multilinear Commitments with Zeromorphblog.zksecurity.xyz