Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
From MaRDI portal
Publication:2118546
Recommendations
- Efficient finite field multiplication for isogeny based post quantum cryptography
- Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
- Faster isogenies for post-quantum cryptography: SIKE
- FINAL: faster FHE instantiated with NTRU and LWE
- Post-Quantum Key Exchange on ARMv8-A: A New Hope for NEON Made Simple
- Faster ECC over \(\mathbb {F}_{2^{521}-1}\) (feat. NEON)
- Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware
- Optimised Multiplication Architectures for Accelerating Fully Homomorphic Encryption
- Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors
Cites work
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- A note on the implementation of the number theoretic transform
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Integer and polynomial multiplication: towards optimal Toom-Cook matrices
- Memory-efficient high-speed implementation of Kyber on Cortex-M4
- On the Minimum Computation Time of Functions
- Post-Quantum Key Exchange on ARMv8-A: A New Hope for NEON Made Simple
- Preprocess-then-NTT Technique and its applications to Kyber and NewHope
- Secure integration of asymmetric and symmetric encryption schemes
Cited in
(3)- Implementing lattice-based PQC on resource-constrained processors: a case study for Kyber/Saber's polynomial multiplication on ARM Cortex-M0/M0+
- Fast Falcon signature generation and verification using ARMv8 NEON instructions
- Hybrid scalar/vector implementations of Keccak and SPHINCS\textsuperscript{+} on AArch64
This page was built for publication: Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118546)