Skip to Main content Skip to Navigation
New interface
Conference papers

GF(2^m) Finite-Field Multipliers with Reduced Activity Variations

Danuta Pamula 1, 2 Arnaud Tisserand 2, * 
* Corresponding author
2 CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
Abstract : Electrical activity variations in a circuit are one of the information leakage used in side channel attacks. In this work, we present GF(2^m) multipliers with reduced activity variations for asymmetric cryptography. Useful activity of typical multiplication algorithms is evaluated. The results show strong shapes, which can be used as a small source of information leakage. We propose modified multiplication algorithms and multiplier architectures to reduce useful activity variations during an operation.
Complete list of metadata
Contributor : Arnaud TISSERAND Connect in order to contact the contributor
Submitted on : Wednesday, July 11, 2012 - 8:56:09 AM
Last modification on : Wednesday, February 2, 2022 - 3:52:45 PM
Long-term archiving on: : Friday, October 12, 2012 - 2:25:43 AM


Publisher files allowed on an open archive



Danuta Pamula, Arnaud Tisserand. GF(2^m) Finite-Field Multipliers with Reduced Activity Variations. WAIFI - 4th International Workshop on Arithmetic of Finite Fields, Jul 2012, Bochum, Germany. pp.152-167, ⟨10.1007/978-3-642-31662-3_11⟩. ⟨hal-00716655⟩



Record views


Files downloads