On the Performance and Security of Multiplication in GF(2N)

On the Performance and Security of Multiplication in GF(2N)

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 algo...

Full description

Bibliographic Details
Main Authors: Jean-Luc Danger, Youssef El Housni, Adrien Facon, Cheikh T. Gueye, Sylvain Guilley, Sylvie Herbel, Ousmane Ndiaye, Edoardo Persichetti, Alexander Schaub
Format: Article
Language:English
Published: MDPI AG 2018-09-01
Series:Cryptography
Subjects:
finite field arithmetic
tower fields
post-quantum cryptography
code-based cryptography
cache-timing attacks
secure implementation
Online Access:http://www.mdpi.com/2410-387X/2/3/25
Description
Summary: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.
ISSN:2410-387X

Similar Items