Next Article in Journal
Comparison of Cost of Protection against Differential Power Analysis of Selected Authenticated Ciphers
Next Article in Special Issue
Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment
Previous Article in Journal
A New Visual Multi-Secrets Sharing Scheme by Random Grids
 
Search for Articles:
Title / Keyword
Author / Affiliation
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
Journals
Cryptography
Volume 2
Issue 3
10.3390/cryptography2030025
cryptography-logo
Submit to this Journal Review for this Journal Edit a Special Issue
► Article Menu

Article Menu

share announcement question_answer thumb_up
...
textsms
...
Article

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

by
Jean-Luc Danger
1,
Youssef El Housni
2,*,
Adrien Facon
2,3,
Cheikh T. Gueye
4,
Sylvain Guilley
1,2,3,
Sylvie Herbel
2,
Ousmane Ndiaye
4,
Edoardo Persichetti
5,* and
Alexander Schaub
1
1
LTCI, Télécom ParisTech, Université Paris-Saclay, 75013 Paris, France
2
Secure-IC S.A.S., 35510 Cesson-Sévigné, France
3
Département d’Informatique, École Normale Supérieure, CNRS, PSL Research University, 75005 Paris, France
4
Département Mathématique et Informatique, Université Cheikh Anta Diop, Dakar 5005, Senegal
5
Department of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL 33431, USA
*
Authors to whom correspondence should be addressed.
Cryptography 2018, 2(3), 25; https://doi.org/10.3390/cryptography2030025
Received: 2 August 2018 / Revised: 4 September 2018 / Accepted: 13 September 2018 / Published: 18 September 2018
(This article belongs to the Special Issue Code-Based Cryptography)
View Full-Text Download PDF

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-Text
Keywords: finite field arithmetic; tower fields; post-quantum cryptography; code-based cryptography; cache-timing attacks; secure implementation finite field arithmetic; tower fields; post-quantum cryptography; code-based cryptography; cache-timing attacks; secure implementation
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
SciFeed

Share and Cite

MDPI and ACS Style

Danger, J.-L.; El Housni, Y.; Facon, A.; Gueye, C.T.; Guilley, S.; Herbel, S.; Ndiaye, O.; Persichetti, E.; Schaub, A. On the Performance and Security of Multiplication in GF(2N). Cryptography 2018, 2, 25. https://doi.org/10.3390/cryptography2030025

AMA Style

Danger J-L, El Housni Y, Facon A, Gueye CT, Guilley S, Herbel S, Ndiaye O, Persichetti E, Schaub A. On the Performance and Security of Multiplication in GF(2N). Cryptography. 2018; 2(3):25. https://doi.org/10.3390/cryptography2030025

Chicago/Turabian Style

Danger, Jean-Luc, Youssef El Housni, Adrien Facon, Cheikh T. Gueye, Sylvain Guilley, Sylvie Herbel, Ousmane Ndiaye, Edoardo Persichetti, and Alexander Schaub. 2018. "On the Performance and Security of Multiplication in GF(2N)" Cryptography 2, no. 3: 25. https://doi.org/10.3390/cryptography2030025

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Map by Country/Region

1
Back to TopTop