Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Electromagnetic Analysis: Concrete Results
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
A Generalized Method for Constructing Subquadratic Complexity GF(2^k) Multipliers
IEEE Transactions on Computers
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
IEEE Transactions on Computers
Cryptographic Algorithms on Reconfigurable Hardware (Signals and Communication Technology)
Cryptographic Algorithms on Reconfigurable Hardware (Signals and Communication Technology)
Power Analysis Attacks: Revealing the Secrets of Smart Cards (Advances in Information Security)
Power Analysis Attacks: Revealing the Secrets of Smart Cards (Advances in Information Security)
Hardware Implementation of Finite-Field Arithmetic
Hardware Implementation of Finite-Field Arithmetic
A high-speed word level finite field multiplier in F2m using redundant representation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Finite field arithmetic for cryptography
IEEE Circuits and Systems Magazine
Optimized System-on-Chip Integration of a Programmable ECC Coprocessor
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation
IEEE Transactions on Computers
| Hi-index | 0.00 |
Electrical activity variations in a circuit are one of the information leakage used in side channel attacks. In this work, we present $\textrm{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.