Expand description
A macro to define efficient and constant-time arithmetic for finite fields Fp with p = 3 mod 4 using Montgomery multiplication.
§Traits
This macro defines a finite field type for GF(p) and also implements the trait Fp by re-exporting all necessary functions.
§Authorship and History
The majority of this code has been adapted from code written by Thomas Pornin from collaboration in previous projects and several methods which appear in other macros in the cryptographic research library crrl https://github.com/pornin/crrl
This code has also been used in a handful of isogeny-based cryptography research projects before being rewritten for this crate, including: