New architecture for multiplication in GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography

Authors:
Soonhak Kwon;Taekyoung Kwon;Young-Ho Park
Affiliations:
Inst. of Basic Science and Dept. of Mathematics, Sungkyunkwan University, Suwon, Korea;School of Computer Engineering, Sejong University, Seoul, Korea;Dept. of Information Security, Sejong Cyber University, Seoul, Korea
Venue:
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Year:
2005

Citing 12
Cited 1

Bit serial multiplication in finite fields

SIAM Journal on Discrete Mathematics
Table of primitive binary polynomials. II

Mathematics of Computation
New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases

IEEE Transactions on Computers
Normal bases via general Gauss periods

Mathematics of Computation
An Efficient Optimal Normal Basis Type II Multiplier

IEEE Transactions on Computers
Handbook of Applied Cryptography

Handbook of Applied Cryptography
GF(2m) Multiplication and Division Over the Dual Basis

IEEE Transactions on Computers
Finite Field Multiplier Using Redundant Representation

IEEE Transactions on Computers
Software Implementation of Elliptic Curve Cryptography over Binary Fields

CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
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

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

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new linear multiplier which is comparable to linear polynomial basis multipliers in terms of the area and time complexity. Also we give a very detailed comparison of our multiplier with the normal and polynomial basis multipliers for the five binary fields GF(2m), m=163,233,283,409,571, recommended by NIST for elliptic curve digital signature algorithm.