A new approach on designing a finite field multiplier architecture is proposed. The proposed architecture trades reduction in the number of clock cycles with resources. This architecture features high performance, simple structure, scalability and independence on the choice of the finite field, and can be used in high security cryptographic applications such as elliptic curve crypto-systems in large prime Galois Fields (GF(2m)).
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Sangook MOON, Yong Joo LEE, Jae Min PARK, Byung In MOON, Yong Surk LEE, "A Fast Finite Field Multiplier Architecture for High-Security Elliptic Curve Cryptosystems" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 2, pp. 418-420, February 2002, doi: .
Abstract: A new approach on designing a finite field multiplier architecture is proposed. The proposed architecture trades reduction in the number of clock cycles with resources. This architecture features high performance, simple structure, scalability and independence on the choice of the finite field, and can be used in high security cryptographic applications such as elliptic curve crypto-systems in large prime Galois Fields (GF(2m)).
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_2_418/_p
Copy
@ARTICLE{e85-d_2_418,
author={Sangook MOON, Yong Joo LEE, Jae Min PARK, Byung In MOON, Yong Surk LEE, },
journal={IEICE TRANSACTIONS on Information},
title={A Fast Finite Field Multiplier Architecture for High-Security Elliptic Curve Cryptosystems},
year={2002},
volume={E85-D},
number={2},
pages={418-420},
abstract={A new approach on designing a finite field multiplier architecture is proposed. The proposed architecture trades reduction in the number of clock cycles with resources. This architecture features high performance, simple structure, scalability and independence on the choice of the finite field, and can be used in high security cryptographic applications such as elliptic curve crypto-systems in large prime Galois Fields (GF(2m)).},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - A Fast Finite Field Multiplier Architecture for High-Security Elliptic Curve Cryptosystems
T2 - IEICE TRANSACTIONS on Information
SP - 418
EP - 420
AU - Sangook MOON
AU - Yong Joo LEE
AU - Jae Min PARK
AU - Byung In MOON
AU - Yong Surk LEE
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2002
AB - A new approach on designing a finite field multiplier architecture is proposed. The proposed architecture trades reduction in the number of clock cycles with resources. This architecture features high performance, simple structure, scalability and independence on the choice of the finite field, and can be used in high security cryptographic applications such as elliptic curve crypto-systems in large prime Galois Fields (GF(2m)).
ER -