ffnt

Crates.ioffnt
lib.rsffnt
version0.8.0
sourcesrc
created_at2024-01-26 13:01:32.495377
updated_at2024-08-16 15:08:26.363802
descriptionFinite fields for number theory
homepage
repository
max_upload_size
id1115514
size102,133
(a-maier)

documentation

README

ffnt

This crate provides prime fields with a characteristic that fits inside a 64 bit (or 32 bit) integer.

It is mostly intended for number-theoretical applications. All algorithms are taken from the NTL library, but for performance and safety reasons the field characteristic is set at compile time.

This crate is not suitable for applications in cryptography

Usage

Add this to your Cargo.toml:

[dependencies]
ffnt = "0.8"

Example

use ffnt::Z64; // or Z32 if the characteristic fits inside 32 bits

// the field characteristic
const P: u64 = 113;

// sum up all elements of the field
let sum = (1..P).map(Z64::<P>::from)
   .reduce(|acc, t| acc + t)
   .unwrap();

// check that the elements sum to 0
// if `num-traits` is enabled it is even better to use `sum.is_zero()`
assert_eq!(sum, Z64::<P>::from(0));

For more examples see the examples directory.

Features

License: GPL-3.0-or-later

Commit count: 0

cargo fmt