Cryptography 2018, 2(3), 25; https://doi.org/10.3390/cryptography2030025
On the Performance and Security of Multiplication in GF(2N)
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
, 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.
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)
Abstract
Multiplications inKeywords:
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 (CC BY 4.0).
Share & Cite This Article
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.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
Article Metrics
Comments
[Return to top]
Cryptography
EISSN 2410-387X
Published by MDPI AG, Basel, Switzerland
RSS
E-Mail Table of Contents Alert