b1ef2682d6
* implement arbitrary precision modular exponentiation (prerequisite EIP-198) * [modexp] implement exponentiation modulo 2ᵏ * add inversion (mod 2ᵏ) * [modexp] High-level wrapper for powmod with odd modulus * [modexp] faster exponentiation (mod 2ᵏ) for even case and Euler's totient function odd case * [modexp] implement general fast modular exponentiation * Fix modular reduction with 64-bit modulus + fuzz powmod vs GMP * add benchmark * add EIP-198 support * fixups following self review * fix test paths |
||
---|---|---|
.. | ||
codegen | ||
kzg | ||
README.md | ||
glv.nim |
README.md
Research
This folder stashes experimentations before they are productionized into the library.
-
GLV
: Scalar multiplication with endomorphism acceleration\- Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
Robert P. Gallant, Robert J. Lambert, and Scott A. Vanstone https://www.iacr.org/archive/crypto2001/21390189.pdf - Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and their Implementation on GLV-GLS Curves (Extended Version)
Armando Faz-Hernández, Patrick Longa, Ana H. Sánchez, 2013
https://eprint.iacr.org/2013/158.pdf
- Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
-
kzg
: KZG Polynomial Commitments\- Constant-Size Commitments to Polynomials and Their Applications
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg, 2010
https://www.iacr.org/archive/asiacrypt2010/6477178/6477178.pdf
- Constant-Size Commitments to Polynomials and Their Applications