5 releases

0.3.1 Jun 1, 2021
0.3.0 Jun 1, 2021
0.2.3 Jul 23, 2020
0.2.2 Apr 11, 2020
0.2.1 Feb 10, 2020

#868 in Cryptography

Download history 447/week @ 2022-08-12 385/week @ 2022-08-19 240/week @ 2022-08-26 331/week @ 2022-09-02 397/week @ 2022-09-09 186/week @ 2022-09-16 248/week @ 2022-09-23 346/week @ 2022-09-30 367/week @ 2022-10-07 222/week @ 2022-10-14 460/week @ 2022-10-21 312/week @ 2022-10-28 291/week @ 2022-11-04 247/week @ 2022-11-11 246/week @ 2022-11-18 87/week @ 2022-11-25

933 downloads per month
Used in 19 crates (12 directly)

MIT/Apache

23KB
514 lines

fff

Fork of the great ff library.

fff is a finite field library written in Rust.

Disclaimers

  • This library does not provide constant-time guarantees.

The fff crate contains Field, PrimeField, PrimeFieldRepr and SqrtField traits. See the documentation for more.

#![derive(PrimeField)]

If you need an implementation of a prime field, this library also provides a procedural macro that will expand into an efficient implementation of a prime field when supplied with the modulus. PrimeFieldGenerator must be an element of Fp of p-1 order, that is also quadratic nonresidue.

First, enable the derive crate feature:

[dependencies]
fff = { version = "0.2", features = ["derive"] }

And then use the macro like so:

extern crate rand;
#[macro_use]
extern crate fff;

#[derive(PrimeField)]
#[PrimeFieldModulus = "52435875175126190479447740508185965837690552500527637822603658699938581184513"]
#[PrimeFieldGenerator = "7"]
struct Fp(FpRepr);

And that's it! Fp now implements Field and PrimeField. Fp will also implement SqrtField if supported. The library implements FpRepr itself and derives PrimeFieldRepr for it.

License

Licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

Dependencies

~280–610KB
~12K SLoC