Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

add unit test for prime power modulus #11

Merged
merged 2 commits into from
Feb 11, 2025
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 27 additions & 4 deletions src/test.rs
Original file line number Diff line number Diff line change
Expand Up @@ -27,10 +27,10 @@ mod tests {

#[test]
fn test_polymul_ntt_square_modulus() {
let p: i64 = 17; // Prime modulus
let modulus: i64 = 17*17; // Prime modulus
let root: i64 = 3; // Primitive root of unity
let n: usize = 8; // Length of the NTT (must be a power of 2)
let omega = omega(root, p*p, n); // n-th root of unity
let omega = omega(root, modulus, n); // n-th root of unity

// Input polynomials (padded to length `n`)
let mut a = vec![1, 2, 3, 4];
Expand All @@ -39,10 +39,33 @@ mod tests {
b.resize(n, 0);

// Perform the standard polynomial multiplication
let c_std = polymul(&a, &b, n as i64, p*p);
let c_std = polymul(&a, &b, n as i64, modulus);

// Perform the NTT-based polynomial multiplication
let c_fast = polymul_ntt(&a, &b, n, modulus, omega);

// Ensure both methods produce the same result
assert_eq!(c_std, c_fast, "The results of polymul and polymul_ntt do not match");
}

#[test]
fn test_polymul_ntt_prime_power_modulus() {
let modulus: i64 = (17 as i64).pow(4); // modulus p^k or 2*p^k
let root: i64 = 3; // Primitive root of unity
let n: usize = 8; // Length of the NTT (must be a power of 2)
let omega = omega(root, modulus, n); // n-th root of unity

// Input polynomials (padded to length `n`)
let mut a = vec![1, 2, 3, 4];
let mut b = vec![4, 5, 6, 7];
a.resize(n, 0);
b.resize(n, 0);

// Perform the standard polynomial multiplication
let c_std = polymul(&a, &b, n as i64, modulus);

// Perform the NTT-based polynomial multiplication
let c_fast = polymul_ntt(&a, &b, n, p*p, omega);
let c_fast = polymul_ntt(&a, &b, n, modulus, omega);

// Ensure both methods produce the same result
assert_eq!(c_std, c_fast, "The results of polymul and polymul_ntt do not match");
Expand Down