MLKEMCipher：定数時間IND-CCA2コア、ベクトル化NTT、バレット剰余削減

MLKEMCipherは、q = 3329およびn = 256の環R_q上のML-KEM多項式演算向けに、依存関係のない固定時間実行のリファレンス実装とアセンブリ最適化カーネルを提供し、証明可能なIND-CCA2安全性を保証します。

MLKEMCipher Lattice Arithmetic Pipeline & Vector Processing Topology

Ring R_q polynomial operations, Number Theoretic Transform (NTT), and Montgomery reduction

Central System: Lattice Vector Engine - AVX-512 / NEON Core

Cryptographic Nodes

  • Forward NTT Unit
  • Pointwise Multiplier
  • Inverse NTT (INTT)
  • Centered Binomial Sampler
  • FO Transform Engine

Architectural Layers & Protocols

  • Polynomial Vector Ring R_q (R_q = Z_q[X]/(X^256 + 1), q=3329): Defines modular lattice algebra with k=2 (512), k=3 (768), and k=4 (1024) matrix ranks.
  • Number Theoretic Transform (Radix-2 Cooley-Tukey NTT with Twiddle Precomputation): Reduces polynomial multiplication complexity from O(n^2) to O(n log n).
  • Fast Modular Reduction (Montgomery Reduction (R = 2^16) & Signed Barrett Reduction): Executes coefficient division and modulo 3329 without hardware divide instructions.
  • Fujisaki-Okamoto Transform (IND-CPA to IND-CCA2 Conversion with Implicit Rejection): Re-encrypts decrypted plaintext to verify ciphertext integrity before key extraction.

Key Metrics: q = 3329 (Prime Modulus) | n = 256 (Polynomial Degree) | O(n log n) (Multiplication Complexity) | 0 Branch (Data-Dependent Branches)

定時間IND-CCA2選択暗号文安全性、NTT多項式ベクトル演算とMontgomery/Barrett法簡約

Authoritative technical engineering reference for constant-time ind-cca2 chosen-ciphertext security, ntt polynomial vector arithmetic & montgomery/barrett modular reduction in NIST FIPS 203/204/205 standards, lattice-based cryptography, side-channel attack mitigation, and quantum-resilient infrastructure.

Core Engineering Areas

Technical Articles

Related Cluster Architecture Specifications