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
Article Menu

Export Article

Open AccessArticle
Cryptography 2018, 2(3), 25; https://doi.org/10.3390/cryptography2030025

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

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)
Full-Text   |   PDF [357 KB, uploaded 19 September 2018]

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 (CC BY 4.0).
SciFeed

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.

Show more citation formats Show less citations formats

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 Statistics

1

Comments

[Return to top]
Cryptography EISSN 2410-387X Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top