Efficient linear array for multiplication over NIST recommended binary fields

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:
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
Year:
2005

Citing 3
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
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography

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.