%0 Journal Article
%T On the Performance and Security of Multiplication in GF(2N)
%A Adrien Facon
%A Alexander Schaub
%A Cheikh T. Gueye
%A Edoardo Persichetti
%A Jean-Luc Danger
%A Ousmane Ndiaye
%A Sylvain Guilley
%A Sylvie Herbel
%A Youssef El Housni
%J -
%D 2018
%R https://doi.org/10.3390/cryptography2030025
%X Abstract Multiplications in G F ( 2 N ) can be securely optimized for cryptographic applications when the integer N is small and does not match machine words (i.e., N < 32 ). In this paper, we present a set of optimizations applied to DAGS, a code-based post-quantum cryptographic algorithm and one of the submissions to the National Institute of Standards and Technology¡¯s (NIST) Post-Quantum Cryptography (PQC) standardization call. View Full-Tex
%K finite field arithmetic
%K tower fields
%K post-quantum cryptography
%K code-based cryptography
%K cache-timing attacks
%K secure implementation
%U https://www.mdpi.com/2410-387X/2/3/25