Paper 2018/039
Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography
Gregor Seiler
Abstract
Constant-time polynomial multiplication is one of the most time-consuming operations in many lattice-based cryptographic constructions. For schemes based on the hardness of Ring-LWE in power-of-two cyclotomic fields with completely splitting primes, the AVX2 optimized implementation of the Number-Theoretic Transform (NTT) from the NewHope key-exchange scheme is the state of the art for fast multiplication. It uses floating point vector instructions. We show that by using a modification of the Montgomery reduction algorithm that enables a fast approach with integer instructions, we can improve on the polynomial multiplication speeds of NewHope and Kyber by a factor of $4.2$ and $6.3$ on Skylake, respectively.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint. MINOR revision.
- Keywords
- lattice cryptographyNTTimplementationAVX
- Contact author(s)
- gseiler @ inf ethz ch
- History
- 2018-01-09: received
- Short URL
- https://ia.cr/2018/039
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/039,
author = {Gregor Seiler},
title = {Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography},
howpublished = {Cryptology ePrint Archive, Paper 2018/039},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/039}},
url = {https://eprint.iacr.org/2018/039}
}
