Update README.md

lattice-based-cryptography · Feb 14, 2025 · b967fc6 · b967fc6
1 parent cc26816
commit b967fc6
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/README.md b/README.md
@@ -6,6 +6,6 @@
 
 Implementation of the number theoretic transform (NTT) in Rust.
 
-The array size `n` must be a power of two. 
+The NTT is a DFT over Z/pZ. We use a fast divide-and conquer algorithm. The array size `n` must be a power of two. 
 
 We allow composite moduli `modulus` for prime powers `p^k` or moduli such that `n` divides `phi(p^e)` for each prime factor p, where `phi` is the Euler totient.