Algorithmic views of vectorized polynomial multipliers -- NTRU

DOI10.1007/978-3-031-56235-8_9MaRDI QIDQ6623353zbMATH OpenFDO

Authors Han-Ting Chen, Yi-Hua Chung, Bo-Yin Yang

Publication date 23 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-56235-8_9

zbMATH Keywords

dual moduleNTRUToeplitz matrixvectorization

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates
• scientific article; zbMATH DE number 3688713 (Why is no real title available?)
• On the Minimum Computation Time of Functions

Cited in

(2)

• A survey of polynomial multiplications for lattice-based cryptosystems
• Efficient isochronous fixed-weight sampling with applications to NTRU

This page was built for publication: Algorithmic views of vectorized polynomial multipliers -- NTRU

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623353)