Paper 2018/1018
Faster multiplication in on Cortex-M4 to speed up NIST PQC candidates
Matthias J. Kannwischer, Joost Rijneveld, and Peter Schwabe
Abstract
In this paper we optimize multiplication of polynomials in
Metadata
- Available format(s)
- Category
- Implementation
- Publication info
- Published elsewhere. Minor revision. ACNS'19
- Keywords
- ARM Cortex-M4KaratsubaToomlattice-based KEMsNTRU
- Contact author(s)
-
joost @ joostrijneveld nl
matthias @ kannwischer eu
peter @ cryptojedi org - History
- 2019-04-09: revised
- 2018-10-24: received
- See all versions
- Short URL
- https://ia.cr/2018/1018
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/1018, author = {Matthias J. Kannwischer and Joost Rijneveld and Peter Schwabe}, title = {Faster multiplication in $\mathbb{Z}_{2^m}[x]$ on Cortex-M4 to speed up {NIST} {PQC} candidates}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/1018}, year = {2018}, url = {https://eprint.iacr.org/2018/1018} }