This repository implements finite field arithmetic, elliptic curves in short Weierstrass form, and other primitives that may be used in more complex protocols, such as pairings, isogenies, etc. When cryptographic protocols are proposed in academia, these crates may be used to implement them and assess performance and complexity.
curveimplementation of point addition and multiplication over a generic elliptic curvefieldairthmetic over finite fields