| Crates.io | fff |
| lib.rs | fff |
| version | 0.3.1 |
| created_at | 2020-02-06 16:56:10.999571+00 |
| updated_at | 2021-06-01 18:44:43.203523+00 |
| description | Library for building and interfacing with finite fields |
| homepage | https://github.com/filecoin-project/ff |
| repository | https://github.com/filecoin-project/ff |
| max_upload_size | |
| id | 205530 |
| size | 36,291 |
Fork of the great ff library.
fff is a finite field library written in Rust.
This library does not provide constant-time guarantees.
The fff crate contains Field, PrimeField, PrimeFieldRepr and SqrtField traits.
See the documentation for more.
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.
Licensed under either of
at your option.
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.