ntt
| Crates.io | ntt |
| lib.rs | ntt |
| version | 0.1.9 |
| created_at | 2025-01-24 20:21:36.535208+00 |
| updated_at | 2025-02-17 20:06:46.564638+00 |
| description | Fast NTT (number theoretic transform) for polynomial multiplcation for primes, prime power, and certain composite moduli. |
| homepage | https://github.com/lattice-based-cryptography/ntt |
| repository | https://github.com/lattice-based-cryptography/ntt |
| max_upload_size | |
| id | 1529915 |
| size | 23,762 |
Jackson Walters (jacksonwalters)
documentation
https://docs.rs/ntt
README
ntt
Implementation of the number theoretic transform (NTT) in Rust.
The NTT is a DFT over the ring Z/mZ. We use a fast divide-and conquer algorithm. The array size n must be a power of two.
We allow composite moduli as long as n divides phi(p^e) for each prime factor p of the modulus, where phi is the Euler totient.