PaReNTT: Low-Latency Parallel Residue Number System and NTT-Based Long Polynomial Modular Multiplication for Homomorphic Encryption

Documenti analoghi

• High-Speed VLSI Architectures for Modular Polynomial Multiplication via Fast Filtering and Applications to Lattice-Based Cryptography
  di: Tan, Weihang, et al.
  Pubblicazione: (2021)
• The Equivalence of Fast Algorithms for Convolution, Parallel FIR Filters, Polynomial Modular Multiplication, and Pointwise Multiplication in DFT/NTT Domain
  di: Parhi, Keshab K.
  Pubblicazione: (2025)
• A Low-Latency FFT-IFFT Cascade Architecture
  di: Parhi, Keshab K.
  Pubblicazione: (2023)
• Long Polynomial Modular Multiplication using Low-Complexity Number Theoretic Transform
  di: Chiu, Sin-Wei, et al.
  Pubblicazione: (2023)
• @NTT: Algorithm-Targeted NTT hardware acceleration via Design-Time Constant Optimization
  di: Nabeel, Mohammed, et al.
  Pubblicazione: (2026)