GF(2^m) Finite-Field Multipliers with Reduced Activity Variations
Résumé
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.
Origine : Fichiers éditeurs autorisés sur une archive ouverte