Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography

  title={Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography},
  author={Patrick Longa and Michael Naehrig},
  booktitle={IACR Cryptology ePrint Archive},
The Number Theoretic Transform (NTT) provides efficient algorithms for cyclic and nega-cyclic convolutions, which have many applications in computer arithmetic, e.g., for multiplying large integers and large degree polynomials. It is commonly used in cryptographic schemes that are based on the hardness of the Ring Learning With Errors (R-LWE) problem to efficiently implement modular polynomial multiplication. We present a new modular reduction technique that is tailored for the special moduli… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS
27 Citations
35 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 27 extracted citations


Publications referenced by this paper.
Showing 1-10 of 35 references

An algorithm for the machine calculation of complex Fourier series

  • J. W. Cooley, J. W. Tukey
  • Mathematics of Computation,
  • 1965
Highly Influential
3 Excerpts

Instruction tables: lists of instruction latencies, throughputs and micro-operation breakdowns for Intel, AMD and VIA CPUs, accessed on 03/04/2016

  • A. Fog
  • 2016
1 Excerpt

LatticeCrypto. https://www.microsoft.com/en-us/research/project/ lattice-cryptography-library/, 2016

  • P. Longa, M. Naehrig
  • 2016
2 Excerpts

Number Theory Library (NTL)

  • V. Shoup
  • http://www.shoup.net/ntl
  • 2016
1 Excerpt

Similar Papers

Loading similar papers…