Results 181 to 190 of about 2,892 (213)
Faster Multiplication in $$\mathbb {Z}_{2^m}[x]$$ on Cortex-M4 to Speed up NIST PQC Candidates
In this paper we optimize multiplication of polynomials in \(\mathbb {Z}_{2^m}[x]\) on the ARM Cortex-M4 microprocessor. We use these optimized multiplication routines to speed up the NIST post-quantum candidates RLizard, NTRU-HRSS, NTRUEncrypt, Saber, and Kindi.
Matthias J. Kannwischer +2 more
openalex +2 more sources
Merkle Tree Ladder Mode: Reducing the Size Impact of NIST PQC Signature Algorithms in Practice
Andrew Fregly +3 more
openalex +2 more sources
On Exploiting Message Leakage in (Few) NIST PQC Candidates for Practical Message Recovery Attacks
Prasanna Ravi +3 more
openalex +2 more sources
NIST PQC: CODE-BASED CRYPTOSYSTEMS
Alexandr Kuznetsov +4 more
openalex +3 more sources
Optimization Study of Toom-Cook Algorithm in NIST PQC SABER Utilizing ARM/NEON Processor
Jingyo Song +2 more
openalex +1 more source
Efficient Implementation of Finite Field Operations in NIST PQC Rainbow
Gwang-Sik Kim, Young Sik Kim
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Exploiting Message Leakage in (Few) NIST PQC Candidates for Practical Message Recovery Attacks
IEEE Transactions on Information Forensics and Security, 2022Prasanna Ravi +2 more
exaly
High-Speed Hardware Architectures and FPGA Benchmarking of CRYSTALS-Kyber, NTRU, and Saber
IEEE Transactions on Computers, 2023Viet Dang, Kris Gaj
exaly

