Multi-word Modular Arithmetic Technique Enhances Cryptographic Efficiency
/ 1 min read
🔗 New multi-word modular arithmetic (MoMA) technique enhances cryptographic efficiency. Researchers have introduced a formalization of multi-word modular arithmetic (MoMA) to address the computational overhead associated with large integer arithmetic in fully homomorphic encryption (FHE) and zero-knowledge proofs (ZKPs). By breaking down large integers into smaller machine word operations, MoMA significantly improves performance, achieving near-ASIC efficiency on commodity GPUs for critical operations like the number theoretic transform (NTT). The study demonstrates that MoMA-based implementations of basic linear algebra subprograms (BLAS) outperform existing multi-precision libraries by substantial margins. This advancement could pave the way for more efficient cryptographic algorithms, potentially reducing the reliance on costly operations such as bootstrapping in FHE systems.
