Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography
By Patrick Longa, Michael Naehrig. 2016
295 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Information Systems
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Léo Ducas
- Kim Laine
- Hao Chen
- Tancrède Lepoint
- Peter Schwabe
- Vadim Lyubashevsky
- Damien Stehlé
- Wei Dai
In Information Systems
- Léo Ducas
- Peter Schwabe
- Wei Dai
- Damien Stehlé
- Vadim Lyubashevsky
- Tancrède Lepoint
- Eike Kiltz
- Gregor Seiler
Citations in the corpus
- HEAX: An Architecture for Computing on Encrypted Data (2019, methodology): “We adapt the algorithms in [44] which analyzes fast NTT algorithms and introduces specific optimizations for negacyclic convolution.”
- CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme (2018, methodology): “The LN implementation is the integer AVX2 implementation from [LN16].”
- HEAX: High-Performance Architecture for Computation on Homomorphically Encrypted Data in the Cloud (2019, methodology): “There are optimizations to integer modular multiplication in the Microsoft SEAL library, which differ from those in [52].”
- Simple Encrypted Arithmetic Library v2.3.0 (2017, background): “enable_ntt true if all NTT can be used for polynomial multiplication (see [26, 28]) with respect to all the factors qi of q, otherwise false.”
- Simple Encrypted Arithmetic Library - SEAL v2.1 (2016, background): “enable_ntt true if NTT can be used for polynomial multiplication [25, 29], otherwise false.”