SMALL: \underline{S}calable \underline{M}atrix origin\underline{A}ted \underline{L}arge integer po\underline{L}ynomial multiplication \underline{A}ccelerator for lattice-based post-quantum cryptography

DOI10.1007/978-3-031-81824-0_17MaRDI QIDQ6996909zbMATH OpenFDO

Authors Jiafeng Xie, Pengzhou He, Samira Carolina Oliva Madrigal, Çetin Kaya Koç

Publication date 15 April 2025

Full work available at URL https://doi.org/10.1007/978-3-031-81824-0_17

zbMATH Keywords

hardware designlattice-based PQCpolynomial multiplication acceleratorscalable matrix originated computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• Discovering faster matrix multiplication algorithms with reinforcement learning
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• The Fast Fourier Transform in a Finite Field

This page was built for publication: SMALL: \underline{S}calable \underline{M}atrix origin\underline{A}ted \underline{L}arge integer po\underline{L}ynomial multiplication \underline{A}ccelerator for lattice-based post-quantum cryptography

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