Long Polynomial Modular Multiplication using Low-Complexity Number Theoretic Transform

Documenti analoghi

• 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)
• PaReNTT: Low-Latency Parallel Residue Number System and NTT-Based Long Polynomial Modular Multiplication for Homomorphic Encryption
  di: Tan, Weihang, et al.
  Pubblicazione: (2023)
• A Unified Hardware Accelerator for Fast Fourier Transform and Number Theoretic Transform
  di: Shrivastava, Rishabh, et al.
  Pubblicazione: (2025)
• High-Speed VLSI Architectures for Modular Polynomial Multiplication via Fast Filtering and Applications to Lattice-Based Cryptography
  di: Tan, Weihang, et al.
  Pubblicazione: (2021)
• Pseudo Random Number Generator using Internet-of-Things Techniques on Portable Field-Programmable-Gate-Array Platform
  di: Teo, Tee Hui
  Pubblicazione: (2025)