@article{ART002021795},
author={Cho Yong Suk and KIM CHANG KYU},
title={esign of Hybrid Finite Field Multiplier over GF(2^163) for Elliptic Curve Cryptosystems},
journal={Journal of Knowledge Information Technology and Systems},
issn={1975-7700},
year={2015},
volume={10},
number={4},
pages={501-507}
TY - JOUR
AU - Cho Yong Suk
AU - KIM CHANG KYU
TI - esign of Hybrid Finite Field Multiplier over GF(2^163) for Elliptic Curve Cryptosystems
JO - Journal of Knowledge Information Technology and Systems
PY - 2015
VL - 10
IS - 4
PB - Korea Knowledge Information Technology Society
SP - 501
EP - 507
SN - 1975-7700
AB - The multiplication over finite field GF(2^163) is the main arithmetic operation in Elliptic Curve Cryptography (ECC). Therefore, the design of efficient dedicated finite field multiplier architectures can lead to dramatic improvement on the overall system performance. In this paper, a hardware implementation of hybrid multiplier over GF(2^163) is presented. The proposed multiplier operates in polynomial basis of GF(2^163). This multiplier’s size of 163 bits is currently recommended by the National Institute of Standards and Technology (NIST) in their elliptic curve digital signature standard (ECDSS), and is used in practice for binary field multiplication in elliptic curve cryptography. The hybrid architecture is -times faster than bit-serial architectures but with lower area complexity than bit-parallel ones, where the value for , 2≤t≤[m/2] , can be arbitrarily selected by the designer to set the tradeoff between area and speed. The most significant feature of the proposed architecture is that a trade-off between hardware complexity and delay time can be achieved. This makes the proposed multipliers suitable for applications where the value of is large but space is of concern, e.g., resource constrained cryptographic systems such as smart cards and mobile phones. In addition, the proposed architecture is highly regular, simple, expandable and therefore, well-suited for VLSI implementation.
KW - Elliptic curve cryptography;Finite fields;Galois fields;Polynomial basis;Multipliers
DO -
UR -
ER -
Cho Yong Suk and KIM CHANG KYU. (2015). esign of Hybrid Finite Field Multiplier over GF(2^163) for Elliptic Curve Cryptosystems. Journal of Knowledge Information Technology and Systems, 10(4), 501-507.
Cho Yong Suk and KIM CHANG KYU. 2015, "esign of Hybrid Finite Field Multiplier over GF(2^163) for Elliptic Curve Cryptosystems", Journal of Knowledge Information Technology and Systems, vol.10, no.4 pp.501-507.
Cho Yong Suk, KIM CHANG KYU "esign of Hybrid Finite Field Multiplier over GF(2^163) for Elliptic Curve Cryptosystems" Journal of Knowledge Information Technology and Systems 10.4 pp.501-507 (2015) : 501.
Cho Yong Suk, KIM CHANG KYU. esign of Hybrid Finite Field Multiplier over GF(2^163) for Elliptic Curve Cryptosystems. 2015; 10(4), 501-507.
Cho Yong Suk and KIM CHANG KYU. "esign of Hybrid Finite Field Multiplier over GF(2^163) for Elliptic Curve Cryptosystems" Journal of Knowledge Information Technology and Systems 10, no.4 (2015) : 501-507.
Cho Yong Suk; KIM CHANG KYU. esign of Hybrid Finite Field Multiplier over GF(2^163) for Elliptic Curve Cryptosystems. Journal of Knowledge Information Technology and Systems, 10(4), 501-507.
Cho Yong Suk; KIM CHANG KYU. esign of Hybrid Finite Field Multiplier over GF(2^163) for Elliptic Curve Cryptosystems. Journal of Knowledge Information Technology and Systems. 2015; 10(4) 501-507.
Cho Yong Suk, KIM CHANG KYU. esign of Hybrid Finite Field Multiplier over GF(2^163) for Elliptic Curve Cryptosystems. 2015; 10(4), 501-507.
Cho Yong Suk and KIM CHANG KYU. "esign of Hybrid Finite Field Multiplier over GF(2^163) for Elliptic Curve Cryptosystems" Journal of Knowledge Information Technology and Systems 10, no.4 (2015) : 501-507.
