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

open access: closed, 2019
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

On Exploiting Message Leakage in (Few) NIST PQC Candidates for Practical Message Recovery Attacks

open access: closedIEEE Transactions on Information Forensics and Security, 2021
Prasanna Ravi   +3 more
openalex   +2 more sources

NIST PQC: CODE-BASED CRYPTOSYSTEMS

open access: closedTelecommunications and Radio Engineering (English Translation of Elektrosvyaz and Radiotekhnika), 2019
Alexandr Kuznetsov   +4 more
openalex   +3 more sources

On Exploiting Message Leakage in (Few) NIST PQC Candidates for Practical Message Recovery Attacks

IEEE Transactions on Information Forensics and Security, 2022
Prasanna Ravi   +2 more
exaly  

Home - About - Disclaimer - Privacy