Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
From MaRDI portal
Publication:2118546
DOI10.1007/978-3-030-81293-5_13OpenAlexW3179873149MaRDI QIDQ2118546
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_13
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (2)
Hybrid scalar/vector implementations of Keccak and SPHINCS\textsuperscript{+} on AArch64 ⋮ Fast Falcon signature generation and verification using ARMv8 NEON instructions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the implementation of the number theoretic transform
- Secure integration of asymmetric and symmetric encryption schemes
- Memory-efficient high-speed implementation of Kyber on Cortex-M4
- Preprocess-then-NTT Technique and its applications to Kyber and NewHope
- Post-Quantum Key Exchange on ARMv8-A: A New Hope for NEON Made Simple
- An Algorithm for the Machine Calculation of Complex Fourier Series
- On the Minimum Computation Time of Functions
This page was built for publication: Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists