Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates

DOI10.1007/978-3-030-21568-2_14zbMath1458.94246OpenAlexW2903169466MaRDI QIDQ2291393

Peter Schwabe, Matthias J. Kannwischer, Joost Rijneveld

Publication date: 30 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-21568-2_14

zbMATH Keywords

NTRUARM Cortex-M4Karatsubalattice-based KEMsToom

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Related Items (5)

Curve448 on 32-bit ARM Cortex-M4 ⋮ Fast first-order masked NTTRU ⋮ On the feasibility of single-trace attacks on the Gaussian sampler using a CDT ⋮ Higher-order masked Saber ⋮ Saber on ESP32

Uses Software

• eBACS
• NTRUEncrypt
• PQM4
• XKCP

This page was built for publication: Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates