New Hardware Architecture for Multiplication over GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography

Authors:
Soonhak Kwon;Taekyoung Kwon;Young-Ho Park
Affiliations:
-;-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2008

Citing 7
Cited 0

Bit serial multiplication in finite fields

SIAM Journal on Discrete Mathematics
Efficient Finite Field Serial/Parallel Multiplication

ASAP '96 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors
Low Complexity Sequential Normal Basis Multipliers over GF(2m)

ARITH '03 Proceedings of the 16th IEEE Symposium on Computer Arithmetic (ARITH-16'03)
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations

IEEE Transactions on Computers
Low Complexity Bit-Parallel Squarer for GF(2n) Defined by Irreducible Trinomials

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
New architecture for multiplication in GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography

ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new linear array for multiplication in GF(2m) which outperforms most of the existing linear multipliers in terms of the area and time complexity. Moreover we will give a very detailed comparison of our array with other existing architectures for the five binary fields GF(2m), m = 163,233,283,409,571, recommended by NIST for elliptic curve cryptography.