Fast and Secure Finite Field Multipliers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Fast and Secure Finite Field Multipliers


The paper presents details on fast and secure GF (2^m) multipliers dedicated to elliptic curve cryptography applications. Presented design approach aims at high efficiency and security against side channel attacks of a hardware multi-plier. The security concern in the design process of a GF (2^m) multiplier is quite a novel concept. Basing on the results obtained in course of conducted research it is argued that, as well as efficiency of the multiplier impacts the efficiency of the cryptoprocessor, the security level of the multiplier impacts the security level of the whole cryptoprocessor. Thus the goal is to find a tradeoff, to compromise efficiency, in terms of speed and area, and security of the multiplier. We intend to secure the multiplier by masking the operation, either by uniformization or by randomization of the power consumption of the device during its work. The design methodology is half automated. The analyzed field sizes are the standard ones, which ensure that a cryptographic system is mathematically safe. The described architecture is based on principles of Mastrovito multiplication method. It is very flexible and enables to improve the resistance against side channel attacks without degrading the multiplier efficiency.
Fichier principal
Vignette du fichier
dsd2015.pdf (400.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01169851 , version 1 (02-07-2015)



Danuta Pamula, Arnaud Tisserand. Fast and Secure Finite Field Multipliers. DSD: Euromicro Conference on Digital System Design, Aug 2015, Funchal, Portugal. ⟨10.1109/DSD.2015.46⟩. ⟨hal-01169851⟩
225 View
565 Download



Gmail Facebook X LinkedIn More