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