research-article

Low space-complexity and low power semi-systolic multiplier architectures over GF(2m) based on irreducible trinomial

Authors:

Atef IbrahimAuthors Info & Claims

Microprocessors & Microsystems, Volume 40, Issue C

Pages 45 - 52

https://doi.org/10.1016/j.micpro.2015.11.016

Published: 01 February 2016 Publication History

Abstract

Propose low power bit-serial and digit-serial semi-systolic multiplier architectures over GF(2m).Develop a new Progressive Reduction Technique (PPR).Develop affine and nonlinear task scheduling functions.Develop affine and nonlinear task projection onto processors.Provide ASIC Implementation for proposed and previously published designs. This paper proposes a three bit-serial and digit-serial semi-systolic GF(2m) multipliers using Progressive Product Reduction (PPR) technique. These architectures are obtained by converting the GF(2m) multiplication algorithm into an iterative algorithm using systematic techniques for scheduling the computational tasks and mapping them to Processing Elements (PE). Three different semi systolic arrays were obtained. ASIC implementation of the proposed designs and previously published schemes were used to verify the performance of the proposed designs. One proposed design has at least 29% lower area compared to previously published bit/digit serial multipliers. This design has also at least 70% lower power compared to previously published bit/digit serial multipliers. Another proposed design has at least 12% lower power-delay product (PDP) compared to previously published bit/digit serial multipliers. This makes the proposed designs more suited to resource-constrained embedded applications.

References

[1]

N. Koblitz, Elliptic curve cryptosys., Math. Comput., 48 (1987) 203-209.

[2]

H. Fan, Y. Dai, Fast bit parallel GF(2n) multiplier for all trinomials, IEEE Trans. Comp., 54 (2005) 485-490.

Digital Library

[3]

A. Reyhani-Masoleh, M. Hasan, Low complexity bit parallel architectures for polynomial basis multiplication over GIF(2m), IEEE Trans. Comp., 53 (2004) 945-959.

Digital Library

[4]

H. Wu, Low complexity bit-parallel multiplier for a class of finite fields, 2006.

[5]

H. Fan, M.A. Hasan, Fast bit parallel-shifted polynomial basis multipliers in GF(2n), IEEE Trans. Circ. and Sys. I. Regular Papers, 53 (2006) 2606-2615.

[6]

B. Sunar, c. Koc, Mastrovito multiplier for all trinomials, IEEE Trans. Comp., 48 (1999) 522-527.

Digital Library

[7]

T. Zhang, K.K. Parhi, Systematic design of original and modified mastrovito multipliers for general irreducible polynomials, IEEE Trans. Comp., 50 (2001) 734-749.

Digital Library

[8]

H. Wu, Bit-parallel finite field multiplier and squarer using polynomial basis, IEEE Trans. Comput., 51 (2002) 750-758.

Digital Library

[9]

J.L. Imana, J.M. Sànchez, F. Tirado, Bit-parallel finite field multipliers for irreducible trinomials, IEEE Trans. Comput., 55 (2006) 520-533.

Digital Library

[10]

W.C. Tsai, S.J. Wang, Two systolic architectures for multiplication in GF(2m), IEE Proc. Comput. Digit. Tech., 147 (2000) 375-382.

[11]

C. Yeh, I. Reed, T. Troung, Systolic multipliers for finite fields gf(2m), IEEE Trans. Comp., C-33 (1984) 357-360.

Digital Library

[12]

C. Wang, J. Lin, Systolic array implementation of multipliers for finite fields GF(2m), IEEE Trans. Circ. Syst., 38 (1991) 796-800.

[13]

S.K. Jain, L. Song, K.K. Parhi, Efficient semisystolic architectures for finite-field arithmetic, IEEE Trans. Very Large Scale Integrated (VLSI) Sys., 6 (1998) 101-113.

Digital Library

[14]

R. Katti, J. Brennan, Low complexity multiplication in finite field using ring representation, IEEE Trans. Comp.s, 52 (2003) 418-427.

Digital Library

[15]

S. Lee, S. Jung, C. Kim, J. Yoon, J. Koh, D. Kim, Design of bit parallel multiplier with lower time complexity, 2003.

[16]

C.-Y. Lee, C.-W. Chiou, Efficient design of low-complexity bit-parallel systolic hankel multipliers to implement multiplication in normal and dual bases of GF(2m), IEICE Trans. Fund. Elec., Comm. Comp. Sc., E88ÉA (2005) 3169-3179.

[17]

S. Kwon, A low complexity and a low latency bit parallel systolic multiplier over GF(2m) using an optimal normal basis of type ii, 2003.

[18]

C.Y. Lee, Low-latency bit-parallel systolic multiplier for irreducible x m + x n + 1 with GCD ( m, n ) = 1, IEICE Trans. Fundamental Electron., Commun. Comput. Sci., E86-A (2003) 2844-2852.

[19]

J.H. Guo, C.L. Wang, Digit-serial systolic multiplier for finite fields GF(2m), IEE Proc. Comput. Digit. Tech., 145 (1998) 143-148.

[20]

C.H. Kim, C.P. Hong, S. Kwon, A digit-serial multiplier for finite field GF(2m), IEEE Trans. Very Large Scale Integr. (VLSI) Sys., 13 (2005) 476-483.

Digital Library

[21]

P.K. Meher, Systolic formulation for low-complexity serial-parallel implementation of unified finite field multiplication over GF(2m), 2007.

[22]

S. Moon, J. Park, Y. Lee, Fast VLSI arithmetic algorithms for high-security elliptic curve cryptographic applications, IEEE Trans. Consum. Electron., 47 (2001) 700-708.

Digital Library

[23]

C.W. Chiou, L.C. Lin, F.H. Chou, S.F. Shu, Low-complexity finite field multiplier using irreducible trinomials, Electron. Letters, 39 (2003) 1709-1711.

[24]

L. Song, K.K. Parhi, Low-energy digit-serial/parallel finite field multipliers, J. VLSI Digit. Process., 19 (1998) 149-166.

Digital Library

[25]

W. Tang, H. Wu, M. Ahmadi, VLSI implementation of bit-parallel word-serial multiplier in GF(2233), 2005.

[26]

C.H. Kim, S. Kwon, C.P. Hong, A fast digit-serial systolic multiplier for finite field GF(2m), 2005.

[27]

M.A. Garca Martnez, R. Posada-Gomez, G. Morales-Luna, F. Rodrguez Henriquez, FPGA implementation of an efficient multiplier over finite fields GF(2m), 2005.

[28]

P. Meher, Systolic and super systolic multipliers for finite field GF(2m) based on irreducible trinomials, IEEE Trans. on Circ. and Sys. - 1, 55 (2008) 1031-1040.

[29]

S. Kung, Prentice-Hall, Englewood Cliffs, N.J., 1988.

[30]

F. Gebali, John Wiley, New York, 2011.

[31]

N.I.o. Standards, T. (NIST), Recommended elliptic curves for federal government use, appendix to FIPS 186-2, 2000.

[32]

P.K. Meher, On efficient implementation of accumulation in finite field over gf(2m) and its applications, IEEE Trans. VLSI Sys., 17 (2009) 541-550.

Digital Library

[33]

J.S. Pan, C.Y. Lee, P.K. Meher, Low-latency digit-serial and digit-parallel systolic multipliers for large binary extension fields, IEEE Trans. Circ. Sys.-I: Regular Papers, 60 (2013) 3195-3204.

[34]

Y.Y. Hua, J.M. Lin, C.W. Chiou, C.Y. Lee, Y.H. Liu, Low space-complexity digit-serial dual basis systolic multiplier over gf(2m) using hankel matrix and karatsuba algorithm, IET Inf. Security, 7 (2013) 75-86.

Cited By

Kanan AGebali FIbrahim A(2017)Design Space Exploration of 2-D Processor Array Architectures for Similarity Distance ComputationIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2017.265690028:8(2218-2228)Online publication date: 13-Jul-2017
https://dl.acm.org/doi/10.1109/TPDS.2017.2656900

Low space-complexity and low power semi-systolic multiplier architectures over GF(2m) based on irreducible trinomial
1. Mathematics of computing

Recommendations

Systolic Array Architectures for Sunar–Koç Optimal Normal Basis Type II Multiplier
We present linear and nonlinear techniques for design exploration of an iterative algorithm. The nonlinear techniques allow control of processor workload and control of communication between processors. The algorithm considered is the Sunar-Koç ...
GF(2m) Multiplication and Division Over the Dual Basis

In this paper an algorithm for GF(2m) multiplication/division is presented and a new, more generalized definition of duality is proposed. From these the bit-serial Berlekamp multiplier is derived and shown to be a specific case of a more general class ...
Low complexity digit serial systolic montgomery multipliers for special class of GF(2^m)

Montgomery Algorithm for modular multiplication with a large modulus has been widely used in public key cryptosystems for secured data communication. This paper presents a digit-serial systolic multiplication architecture for all-one polynomials (AOP) ...

Comments

Information & Contributors

Information

Published In

cover image Microprocessors & Microsystems

Microprocessors & Microsystems Volume 40, Issue C

February 2016

190 pages

ISSN:0141-9331

Issue’s Table of Contents

Copyright © Elsevier B.V.

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 February 2016

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kanan AGebali FIbrahim A(2017)Design Space Exploration of 2-D Processor Array Architectures for Similarity Distance ComputationIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2017.265690028:8(2218-2228)Online publication date: 13-Jul-2017
https://dl.acm.org/doi/10.1109/TPDS.2017.2656900

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents