PQ-WB-KEM: White-Box ML-KEM-768 1.0
PQ-WB-KEM: Toward a White-Box Construction of ML-KEM-768 with Arithmetic Masking for M2M Communications - Mathematics (MDPI)
Loading...
Searching...
No Matches
ntt_verification.sage
Go to the documentation of this file.
1#!/usr/bin/env sage
2# @file ntt_verification.sage
3# @brief Verify NTT domain structure for ML-KEM-768.
4# @note Theorem 1: X^256 + 1 = prod_{i=0}^{127} (X^2 - zeta^{2i+1}) mod 3329.
5
6import json
7import os
8from datetime import datetime
9
10print("=" * 60)
11print("NTT Domain Verification for ML-KEM-768")
12print("Paper 1: PQ-WB-KEM")
13print("=" * 60)
14
15# ML-KEM parameters
16q = 3329
17n = 256
18zeta = 17
19
20results = {
21 "parameters": {"q": q, "n": n, "zeta": zeta},
22 "verifications": {}
23}
24
25# Verification 1: Group structure
26print("\n[1] Verifying group structure...")
27
28Zq = GF(q)
29group_order = q - 1
30print(f" q = {q}")
31print(f" q - 1 = {group_order}")
32print(f" Factorization: {factor(group_order)}")
33
34# Check 256 divides q-1
35divides = (group_order % n == 0)
36print(f" 256 | (q-1) = {divides}")
37results["verifications"]["256_divides_q_minus_1"] = divides
38
39# Verification 2: zeta = 17 is primitive 256th root
40print("\n[2] Verifying zeta = 17 is primitive 256th root...")
41
42zeta_Zq = Zq(zeta)
43
44# Check zeta^256 = 1
45zeta_256 = zeta_Zq^256
46is_256th_root = (zeta_256 == 1)
47print(f" 17^256 mod 3329 = {zeta_256}")
48print(f" 17^256 = 1 (mod 3329): {is_256th_root}")
49results["verifications"]["zeta_256_equals_1"] = is_256th_root
50
51# Check zeta^128 = -1 (primitive, not 128th root)
52zeta_128 = zeta_Zq^128
53is_primitive = (zeta_128 == Zq(-1))
54print(f" 17^128 mod 3329 = {zeta_128}")
55print(f" 17^128 = -1 (mod 3329): {is_primitive}")
56results["verifications"]["zeta_128_equals_minus_1"] = is_primitive
57
58# Additional check: not smaller order
59zeta_64 = zeta_Zq^64
60not_64th_root = (zeta_64 != 1 and zeta_64 != Zq(-1))
61print(f" 17^64 mod 3329 = {zeta_64}")
62print(f" 17^64 != +/- 1: {not_64th_root}")
63results["verifications"]["not_smaller_order"] = not_64th_root
64
65# Verification 3: 512th roots don't exist
66print("\n[3] Verifying 512th primitive roots don't exist...")
67
68divides_512 = (group_order % 512 == 0)
69print(f" 512 | (q-1) = {group_order % 512 == 0}")
70print(f" No 512th roots exist: {not divides_512}")
71results["verifications"]["no_512th_roots"] = not divides_512
72
73# Verification 4: X^256 + 1 factorization
74print("\n[4] Factoring X^256 + 1 over Z_3329...")
75
76R.<X> = PolynomialRing(Zq)
77poly = X^256 + 1
78factors = poly.factor()
79
80print(f" Number of factors: {len(factors)}")
81print(f" Expected: 128 degree-2 irreducible factors")
82
83# Check all factors are degree 2
84all_degree_2 = all(f[0].degree() == 2 for f in factors)
85num_factors = len(factors)
86correct_factorization = (num_factors == 128 and all_degree_2)
87
88print(f" All factors degree 2: {all_degree_2}")
89print(f" Correct factorization: {correct_factorization}")
90results["verifications"]["128_irreducible_factors"] = correct_factorization
91
92# Verification 5: Each zeta^(2i+1) is QNR
93print("\n[5] Verifying each zeta^(2i+1) is quadratic non-residue...")
94
95qnr_count = 0
96qnr_failures = []
97
98for i in range(128):
99 gamma = zeta_Zq^(2*i + 1)
100 # Check if gamma is QNR using Legendre symbol
101 legendre = kronecker(Integer(gamma), q)
102 is_qnr = (legendre == -1)
103 if is_qnr:
104 qnr_count += 1
105 else:
106 qnr_failures.append(i)
107
108print(f" QNR count: {qnr_count}/128")
109print(f" All 128 are QNR: {qnr_count == 128}")
110if qnr_failures:
111 print(f" Failures at indices: {qnr_failures}")
112results["verifications"]["all_128_qnr"] = (qnr_count == 128)
113results["qnr_count"] = qnr_count
114
115# Verification 6: Explicit irreducibility check
116print("\n[6] Explicit irreducibility check for each X^2 - gamma...")
117
118irreducible_count = 0
119for i in range(128):
120 gamma = zeta_Zq^(2*i + 1)
121 quad_poly = X^2 - gamma
122 is_irred = quad_poly.is_irreducible()
123 if is_irred:
124 irreducible_count += 1
125
126print(f" Irreducible count: {irreducible_count}/128")
127print(f" All 128 irreducible: {irreducible_count == 128}")
128results["verifications"]["all_128_irreducible"] = (irreducible_count == 128)
129
130# Summary
131print("\n" + "=" * 60)
132print("VERIFICATION SUMMARY")
133print("=" * 60)
134
135all_passed = all(results["verifications"].values())
136results["all_passed"] = all_passed
137
138for key, value in results["verifications"].items():
139 status = "PASS" if value else "FAIL"
140 print(f" [{status}] {key}")
141
142print("\n" + "=" * 60)
143if all_passed:
144 print("ALL VERIFICATIONS PASSED")
145 print("NTT domain structure confirmed for white-box implementation")
146else:
147 print("SOME VERIFICATIONS FAILED - CHECK RESULTS")
148print("=" * 60)
149
150# Save results
151script_dir = os.path.dirname(os.path.abspath(__file__))
152results_dir = os.path.join(os.path.dirname(os.path.dirname(script_dir)), "results")
153os.makedirs(results_dir, exist_ok=True)
154output_file = os.path.join(results_dir, "ntt_verification.json")
155try:
156 with open(output_file, "w") as f:
157 json.dump(results, f, indent=2, default=str)
158 print("\nResults saved to {}".format(output_file))
159except Exception as e:
160 print("\nError saving results: {}".format(e))
161 print("\nResults: {}".format(results))