Reduced complexity polynomial multiplier architecture for finite fields GF(2m)

Se Hyu Choi; Keon Jik Lee

doi:10.1587/elex.14.20160797

Reduced complexity polynomial multiplier architecture for finite fields GF(2^m)

Se Hyu Choi, Keon Jik Lee

Department of Civil Engineering

GISTech Korea

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

This letter presents a low-complexity semi-systolic array implementation for polynomial multiplication over GF(2^m). We consider finite field Montgomery modular multiplication (MMM) based on two-level parallel computing approach to reduce the cell delay, latency, and area-time (AT) complexity. Compared to related multipliers, the proposed scheme yields significantly lower AT complexity.

Original language	English
Article number	20160797
Journal	IEICE Electronics Express
Volume	14
Issue number	17
DOIs	https://doi.org/10.1587/elex.14.20160797
State	Published - 2017

Keywords

Finite field arithmetic
Modular multiplication
Systolic array

Access to Document

10.1587/elex.14.20160797

Cite this

@article{b9a33af4862e45a58f71774c22ef431c,

title = "Reduced complexity polynomial multiplier architecture for finite fields GF(2m)",

abstract = "This letter presents a low-complexity semi-systolic array implementation for polynomial multiplication over GF(2m). We consider finite field Montgomery modular multiplication (MMM) based on two-level parallel computing approach to reduce the cell delay, latency, and area-time (AT) complexity. Compared to related multipliers, the proposed scheme yields significantly lower AT complexity.",

keywords = "Finite field arithmetic, Modular multiplication, Systolic array",

author = "Choi, {Se Hyu} and Lee, {Keon Jik}",

note = "Publisher Copyright: {\textcopyright} IEICE 2017.",

year = "2017",

doi = "10.1587/elex.14.20160797",

language = "English",

volume = "14",

journal = "IEICE Electronics Express",

issn = "1349-2543",

publisher = "The Institute of Electronics, Information and Communication Engineers (IEICE)",

number = "17",

}

TY - JOUR

T1 - Reduced complexity polynomial multiplier architecture for finite fields GF(2m)

AU - Choi, Se Hyu

AU - Lee, Keon Jik

N1 - Publisher Copyright: © IEICE 2017.

PY - 2017

Y1 - 2017

N2 - This letter presents a low-complexity semi-systolic array implementation for polynomial multiplication over GF(2m). We consider finite field Montgomery modular multiplication (MMM) based on two-level parallel computing approach to reduce the cell delay, latency, and area-time (AT) complexity. Compared to related multipliers, the proposed scheme yields significantly lower AT complexity.

AB - This letter presents a low-complexity semi-systolic array implementation for polynomial multiplication over GF(2m). We consider finite field Montgomery modular multiplication (MMM) based on two-level parallel computing approach to reduce the cell delay, latency, and area-time (AT) complexity. Compared to related multipliers, the proposed scheme yields significantly lower AT complexity.

KW - Finite field arithmetic

KW - Modular multiplication

KW - Systolic array

UR - http://www.scopus.com/inward/record.url?scp=85029397838&partnerID=8YFLogxK

U2 - 10.1587/elex.14.20160797

DO - 10.1587/elex.14.20160797

M3 - Article

AN - SCOPUS:85029397838

SN - 1349-2543

VL - 14

JO - IEICE Electronics Express

JF - IEICE Electronics Express

IS - 17

M1 - 20160797

ER -

Reduced complexity polynomial multiplier architecture for finite fields GF(2^m)

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this