## Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over GF(2 m (2004)

Venue: | IEEE Transactions on Computers |

Citations: | 18 - 2 self |

### BibTeX

@ARTICLE{Reyhani-masoleh04lowcomplexity,

author = {Arash Reyhani-masoleh and M. Anwar Hasan and Senior Member},

title = {Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over GF(2 m},

journal = {IEEE Transactions on Computers},

year = {2004},

volume = {53},

pages = {945--959}

}

### OpenURL

### Abstract

Abstract—Representing the field elements with respect to the polynomial (or standard) basis, we consider bit parallel architectures for multiplication over the finite field GFð2 m Þ. In this effect, first we derive a new formulation for polynomial basis multiplication in terms of the reduction matrix Q. The main advantage of this new formulation is that it can be used with any field defining irreducible polynomial. Using this formulation, we then develop a generalized architecture for the multiplier and analyze the time and gate complexities of the proposed multiplier as a function of degree m and the reduction matrix Q. To the best of our knowledge, this is the first time that these complexities are given in terms of Q. Unlike most other articles on bit parallel finite field multipliers, here we also consider the number of signals to be routed in hardware implementation and we show that, compared to the well-known Mastrovito’s multiplier, the proposed architecture has fewer routed signals. In this article, the proposed generalized architecture is further optimized for three special types of polynomials, namely, equally spaced polynomials, trinomials, and pentanomials. We have obtained explicit formulas and complexities of the multipliers for these three special irreducible polynomials. This makes it very easy for a designer to implement the proposed multipliers using hardware description languages like VHDL and Verilog with minimum knowledge of finite field arithmetic. Index Terms—Finite or Galois field, Mastrovito multiplier, all-one polynomial, polynomial basis, trinomial, pentanomial and equallyspaced polynomial. 1

### Citations

450 |
Algebraic coding theory
- Berlekamp
- 1968
(Show Context)
Citation Context ...ultiplier over GFð2 m Þ was suggested by Bartee and Schneider [3]. Depending on the irreducible polynomial, this implementation requires as many as m 3 m two-input adders over GFð2Þ (i.e., XOR gates) =-=[4]-=-. Because of its high circuit complexity and lack of regularity, it is often advantageous to use other hardware structures to implement the multiplier [16]. In [13], [12], Mastrovito has proposed an a... |

417 |
Introduction to Finite Fields and their Applications
- Lidl, Niederreiter
- 1994
(Show Context)
Citation Context ...any such cryptosystems rely on computations in very large finite fields and require fast computations in the fields [14], [2]. Finite field arithmetic operations are also used in error control coding =-=[11]-=-, [16], VLSI testing [6], [27], and digital signal processing [5]. Among the basic arithmetic operations over the finite field GFð2mÞ, addition is easily realized using m two-input XOR gates, while mu... |

107 |
Fast Algorithms for Digital Signal Processing
- Blahut
- 1985
(Show Context)
Citation Context ...ields and require fast computations in the fields [14], [2]. Finite field arithmetic operations are also used in error control coding [11], [16], VLSI testing [6], [27], and digital signal processing =-=[5]-=-. Among the basic arithmetic operations over the finite field GFð2mÞ, addition is easily realized using m two-input XOR gates, while multiplication is costly in terms of gate count and time delay. The... |

100 |
An implementation f elliptic curve cryptosystems over ]F2~55
- Agnew, Mnllin, et al.
(Show Context)
Citation Context ...d with some form of cryptosystems to provide various kinds of data security. Many such cryptosystems rely on computations in very large finite fields and require fast computations in the fields [14], =-=[2]-=-. Finite field arithmetic operations are also used in error control coding [11], [16], VLSI testing [6], [27], and digital signal processing [5]. Among the basic arithmetic operations over the finite ... |

60 |
VLSI Architecture for Computations in Galois Fields
- Mastrovito
- 1991
(Show Context)
Citation Context ... adders over GFð2Þ (i.e., XOR gates) [4]. Because of its high circuit complexity and lack of regularity, it is often advantageous to use other hardware structures to implement the multiplier [16]. In =-=[13]-=-, [12], Mastrovito has proposed an algorithm along with its hardware architecture (hereafter referred to as the Mastrovito algorithm/multiplier) for PB multiplication. Sunar and Koc [24] have presente... |

53 |
Applications of Finite Fields
- Menezes, Blake, et al.
- 1993
(Show Context)
Citation Context ...quipped with some form of cryptosystems to provide various kinds of data security. Many such cryptosystems rely on computations in very large finite fields and require fast computations in the fields =-=[14]-=-, [2]. Finite field arithmetic operations are also used in error control coding [11], [16], VLSI testing [6], [27], and digital signal processing [5]. Among the basic arithmetic operations over the fi... |

37 | Mastrovito multiplier for all trinomials
- Sunar, Koç
- 1999
(Show Context)
Citation Context ...lier [16]. In [13], [12], Mastrovito has proposed an algorithm along with its hardware architecture (hereafter referred to as the Mastrovito algorithm/multiplier) for PB multiplication. Sunar and Koc =-=[24]-=- have presented a new formulation for the Mastrovito algorithm using trinomials and have shown that m 2 1 XOR and m 2 AND gates are sufficient to implement the multiplier. In [8], Halbutogullari and K... |

30 |
VLSI Design for Multiplication over Finite Fields GF(2m
- Mastrovito
- 1989
(Show Context)
Citation Context ...s over GFð2Þ (i.e., XOR gates) [4]. Because of its high circuit complexity and lack of regularity, it is often advantageous to use other hardware structures to implement the multiplier [16]. In [13], =-=[12]-=-, Mastrovito has proposed an algorithm along with its hardware architecture (hereafter referred to as the Mastrovito algorithm/multiplier) for PB multiplication. Sunar and Koc [24] have presented a ne... |

27 | Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2 - Hasan, Wang, et al. - 1992 |

26 | Table of Low-Weight Binary Irreducible Polynomials," Visual Computing
- Seroussi
- 1998
(Show Context)
Citation Context ...ince low Hamming weight polynomials can potentially reduce the space and time complexities of a finite field multiplier, irreducible trinomials have drawn significant attention in the past. Reference =-=[22]-=- lists an irreducible trinomial for every degree m ( 10; 000) for which such a polynomial exists. m 2 issREYHANI-MASOLEH AND HASAN: LOW COMPLEXITY BIT PARALLEL ARCHITECTURES FOR POLYNOMIAL BASIS MULTI... |

25 |
Error-Control Coding for Data Networks
- Reed, Chen
- 1999
(Show Context)
Citation Context ...ch cryptosystems rely on computations in very large finite fields and require fast computations in the fields [14], [2]. Finite field arithmetic operations are also used in error control coding [11], =-=[16]-=-, VLSI testing [6], [27], and digital signal processing [5]. Among the basic arithmetic operations over the finite field GFð2mÞ, addition is easily realized using m two-input XOR gates, while multipli... |

21 | Mastrovito multiplier for general irreducible polynomials
- Halbutoǧulları, Koç
- 2000
(Show Context)
Citation Context ...ation. Sunar and Koc [24] have presented a new formulation for the Mastrovito algorithm using trinomials and have shown that m 2 1 XOR and m 2 AND gates are sufficient to implement the multiplier. In =-=[8]-=-, Halbutogullari and Koc have generalized the approach of Sunar and Koc and have found a method for constructing the Mastrovito multiplier for arbitrary irreducible polynomials. This method considers ... |

17 | Parallel Multipliers Based on Special Irreducible Pentanomials
- Rodrı´guez-Henrı´quez, Koc
- 2003
(Show Context)
Citation Context ...weight of the irreducible polynomial. In hardware implementation, its multiplication operations can be realized with m 2 AND and ðm 1Þ 2 þð! 1Þðm 1Þ XOR gates. Recently, RodriguezHenriquez and Koc in =-=[20]-=- proposed a PB multiplier for special case of pentanomials and have obtained its time delay and gate count. Although they have referred to it as the Mastrovito multiplier, their architecture is differ... |

15 |
Bit-parallel finite field multiplier and square using polynomial basis
- Wu
(Show Context)
Citation Context ...is approach has been used in a number of papers. For 0018-9340/04/$20.00 ß 2004 IEEE Published by the IEEE Computer Societys946 IEEE TRANSACTIONS ON COMPUTERS, VOL. 53, NO. 8, AUGUST 2004 example, in =-=[25]-=-, Wu considered irreducible trinomials as reduction polynomials and showed that a modular multiplication operation in GFð2 m Þ can be performed with ð! 1Þðm 1Þ bit additions, where ! is the Hamming we... |

14 |
Computation with Finite Fields
- Bartee, Schneider
- 1963
(Show Context)
Citation Context ...c@computer.org, and reference IEEECS Log Number TC-0090-0703. æ 1.1 Summary of Previous Work The earliest parallel polynomial basis (PB) multiplier over GFð2 m Þ was suggested by Bartee and Schneider =-=[3]-=-. Depending on the irreducible polynomial, this implementation requires as many as m 3 m two-input adders over GFð2Þ (i.e., XOR gates) [4]. Because of its high circuit complexity and lack of regularit... |

12 |
Scan-based BIST fault diagnosis
- Wu, Adham
(Show Context)
Citation Context ... computations in very large finite fields and require fast computations in the fields [14], [2]. Finite field arithmetic operations are also used in error control coding [11], [16], VLSI testing [6], =-=[27]-=-, and digital signal processing [5]. Among the basic arithmetic operations over the finite field GFð2mÞ, addition is easily realized using m two-input XOR gates, while multiplication is costly in term... |

10 |
Systolic Array Implementation of Euclid’s Algorithm for Inversion and Division in GF(2m
- Guo, Wang
- 1998
(Show Context)
Citation Context ...n is costly in terms of gate count and time delay. The other operations of finite fields, such as exponentiation, division, and inversion can be performed by repeated multiplications [21], [26], [1], =-=[7]-=-. In order to satisfy the high speed requirements of many such applications, there is a need to develop an efficient architecture for finite field multiplication which is suitable for VLSI implementat... |

8 |
Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials
- Zhang, Parhi
(Show Context)
Citation Context ...-one polynomials (AOPs) and equally spaced polynomials (ESPs). So far, for these special polynomials, the XOR gate count and time delay of the Halbutogullari-Koc algorithm appear to be the lowest. In =-=[28]-=-, Zhang and Parhi propose a systematic method to design the Mastrovito multiplier. Moreover, they extend the method to systematically design the modified Mastrovito multiplication scheme proposed in [... |

2 | On low complexity bit parallel polynomial basis multipliers,” in Cryptographic Hardware and Embedded Systems, ser - Reyhani-Masoleh, Hasan - 2003 |

1 |
Arithmetic Operations in GFð2mÞ
- Agnew, Beth, et al.
- 1993
(Show Context)
Citation Context ...cation is costly in terms of gate count and time delay. The other operations of finite fields, such as exponentiation, division, and inversion can be performed by repeated multiplications [21], [26], =-=[1]-=-, [7]. In order to satisfy the high speed requirements of many such applications, there is a need to develop an efficient architecture for finite field multiplication which is suitable for VLSI implem... |

1 |
The Generation of Primitive Polynomials in GFðqÞ with Independent Roots and Their Application for Power Residue Codes, VLSI Testing and Finite Field Multipliers Using Normal Bases
- Gulliver, Serra, et al.
- 1991
(Show Context)
Citation Context ...ly on computations in very large finite fields and require fast computations in the fields [14], [2]. Finite field arithmetic operations are also used in error control coding [11], [16], VLSI testing =-=[6]-=-, [27], and digital signal processing [5]. Among the basic arithmetic operations over the finite field GFð2mÞ, addition is easily realized using m two-input XOR gates, while multiplication is costly i... |

1 | Structure of Parallel Mutipliers for a Class of Fields GFð2 m Þ - Itoh, Tsujii - 1989 |

1 | A New Efficient Architecture of Mastrovito Multiplier over GFð2 m Þ - Reyhani-Masoleh, Hasan - 2000 |

1 |
Architectures for Exponentiation in GFð2 m Þ
- Scott, Simmons, et al.
- 1988
(Show Context)
Citation Context ...ile multiplication is costly in terms of gate count and time delay. The other operations of finite fields, such as exponentiation, division, and inversion can be performed by repeated multiplications =-=[21]-=-, [26], [1], [7]. In order to satisfy the high speed requirements of many such applications, there is a need to develop an efficient architecture for finite field multiplication which is suitable for ... |

1 |
Low Complexity Modified Mastrovito Multipliers over Finite Fields GFð2
- Song, Parhi
- 1999
(Show Context)
Citation Context ...], Zhang and Parhi propose a systematic method to design the Mastrovito multiplier. Moreover, they extend the method to systematically design the modified Mastrovito multiplication scheme proposed in =-=[23]-=-. They also present new results of the complexities of the Mastrovito multiplier for two classes of irreducible pentanomials. Unlike Mastrovito’s method, a GFð2 m Þ multiplication can also be performe... |

1 |
Efficient Exponentiation of a Primitive Root in GFð2 m Þ
- Wu, Hasan
- 1997
(Show Context)
Citation Context ...ltiplication is costly in terms of gate count and time delay. The other operations of finite fields, such as exponentiation, division, and inversion can be performed by repeated multiplications [21], =-=[26]-=-, [1], [7]. In order to satisfy the high speed requirements of many such applications, there is a need to develop an efficient architecture for finite field multiplication which is suitable for VLSI i... |