Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m)

Cho Yong Suk; 민경일

@article{ART001985114},
author={Cho Yong Suk and 민경일},
title={Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m)},
journal={Journal of Knowledge Information Technology and Systems},
issn={1975-7700},
year={2015},
volume={10},
number={2},
pages={271-277}

TY - JOUR
AU - Cho Yong Suk
AU - 민경일
TI - Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m)
JO - Journal of Knowledge Information Technology and Systems
PY - 2015
VL - 10
IS - 2
PB - Korea Knowledge Information Technology Society
SP - 271
EP - 277
SN - 1975-7700
AB - Finite field multipliers are the basic building blocks in many applications such as error-control coding, cryptography and digital signal processing. Hence, 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 -times fast hybrid finite field multiplier is presented. The proposed multiplier is used for polynomial basis of finite fields . The proposed architecture is -times faster than bit-serial architectures but with lower area complexity than bit-parallel ones, where the value for , , can be arbitrarily selected by the designer to set the tradeoff between area and speed. In this multiplier, a field element of -bit length is subdivided into several parts to speed up the multiplication operation. In every clock cycle, the multiplication of -bit sub-word and an -bit multiplicand produces one -bit product. 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. In addition, the proposed architecture is highly regular, simple, expandable and therefore, well-suited for VLSI implementation.
KW - Finite fields;Galois fields;Polynomial Basis;Multipliers;Cryptographies
DO -
UR -
ER -

Cho Yong Suk and 민경일. (2015). Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m). Journal of Knowledge Information Technology and Systems, 10(2), 271-277.

Cho Yong Suk and 민경일. 2015, "Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m)", Journal of Knowledge Information Technology and Systems, vol.10, no.2 pp.271-277.

Cho Yong Suk, 민경일 "Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m)" Journal of Knowledge Information Technology and Systems 10.2 pp.271-277 (2015) : 271.

Cho Yong Suk, 민경일. Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m). 2015; 10(2), 271-277.

Cho Yong Suk and 민경일. "Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m)" Journal of Knowledge Information Technology and Systems 10, no.2 (2015) : 271-277.

Cho Yong Suk; 민경일. Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m). Journal of Knowledge Information Technology and Systems, 10(2), 271-277.

Cho Yong Suk; 민경일. Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m). Journal of Knowledge Information Technology and Systems. 2015; 10(2) 271-277.

Cho Yong Suk, 민경일. Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m). 2015; 10(2), 271-277.

Cho Yong Suk and 민경일. "Hardware Implementation of -times Fast Hybrid Polynomial Basis Multiplier over GF(2m)" Journal of Knowledge Information Technology and Systems 10, no.2 (2015) : 271-277.

KJC Korea
Journal Central

Statistics

Tools

Sharing

Issue List

Citation status