1

TOEPLITZ MATRIX APPROACH FOR BINARY FIELD MULTIPLICATION USING QUADRINOMIALS

ABY AUGUSTINE TOM M.E VLSI DESIGN REG NO: 2011236001

UNDER THE GUIDENCE Dr. D SRIDHARAN, Associate. Prof. Dept of ECE, CEG
2

BINARY FIELD MULTIPLICATION

CONTENTS
BINARY FIELD MULTIPLICATION EXAMPLE SAMPLE OUTPUT IN MATLAB BASE PAPER DESCRIPTION

BINARY FIELD MULTIPLICATION

BINARY FIELD
GF(2m) Finite Field of binary polynomials.

A(x) = a0x0 + a1x1 + a2x2 + + am-2xm-2 + am-1xm-1,

ai = {0, 1}.
GF(2m) -Elements can take 2m different values . Maximal term in a number in GF(2m) is xm-1 MATLAB code for generating Binary Field gf8 = gf([0:7],3); % Galois vector in GF(2^3)
4

BINARY FIELD MULTIPLICATION

GF(8) BINARY FIELD

Integer Representation 0 1 2 3 4 5 6 7 Binary Representation 000 001 010 011 100 101 110 111

m=3
Element of GF(8) 0 1 A A+1 A2 A2 + 1 A2 + A A2 + A + 1
5

BINARY FIELD MULTIPLICATION

BINARY FIELD conti

For each binary field, an irreducible polynomial f(x) is defined

f (x) = T(x) + xm,

T(x) = x0 + t1x1 + t2x2 + + tm-2xm-2 + tm1xm-1 All operations in GF(2m) are performed GF(2 modulo f(x) f(x).
6

BINARY FIELD MULTIPLICATION

m) PRIMITIVE POLYNOMIAL FOR A GF(2

m = 4; % Or choose any positive integer value of m. alph = gf(2,m) % Primitive element in GF(2^m) The output is alph = GF(2^4) array. Primitive polynomial = D^4+D+1 (19 decimal)
7

BINARY FIELD MULTIPLICATION

BINARY FIELD conti

There are two defined operations, namely addition and multiplication. Result of adding or multiplying two elements field. from the field is always an element in the field. m = 3; gf([ ^m- ]',m); ([0 els = gf([0:2^m-1]',m); multb = els * els' % Multiply els by its own matrix transpose. multb = GF(2^3) array. Primitive polynomial = D^3+D+1 (11 decimal) 8

BINARY FIELD MULTIPLICATION

MODULO 11 MULTIPLICATION 0 1 2 3 4 5 6 7
0 5 1 4 2 7 3 6 0 6 7 1 5 3 2 4 0 7 5 2 1 6 4 3
9

0 1 2 3 4 5 6 7

0 0 0 0 0 0 0 0

0 1 2 3 4 5 6 7

0 2 4 6 3 1 7 5

0 3 6 5 7 4 1 2

0 4 3 7 6 2 5 1

BINARY FIELD MULTIPLICATION

INTRODUCTION TO ALGORITHM
In the recent past, subquadratic space complexity multipliers have been proposed for binary fields defined by irreducible trinomials and some specific pentanomials. pentanomials. For such multipliers, alternative irreducible

polynomials can also be used, in particular, nearly all one polynomials (NAOPs) seem to be better than pentanomials
10

BINARY FIELD MULTIPLICATION

INTRODUCTION TO ALGORITHM conti

For improved efficiency, multiplication modulo an NAOP is performed via modulo a quadrinomial whose degree is one more than that of the original NAOP For hardware implementation of certain finitecryptosystems, a finite-field multiplier can be one of the most space demanding blocks circuitIn order to make such a multiplier circuit-efficient, low weight irreducible polynomials are used for defining the finite fields
11

BINARY FIELD MULTIPLICATION

INTRODUCTION TO ALGORITHM conti

For an irreducible polynomial, with coefficients being 0 and 1 only, the least weight is three, do not exist for all degrees

12

BINARY FIELD MULTIPLICATION

QUADRINOMIAL APPROACH
Use a low weight composite, instead of irreducible Reduce the circuit requirement of the multiplier PastPast-Composite binomials of the form X^n+1 For reduced redundancy, such a binomial is X+1 chosen to be the product of X+1 and an allirreducible all-one polynomial (AOP) X+1 The multiplication of X+1 and an NAOP results in a polynomial of weight four
13

BINARY FIELD MULTIPLICATION

SELECTED IRREDUCIBLE NAOPS OF DEGREE m

14

SEQUENTIAL MULTIPLIER WITH SERIAL OUTPUT

XOR TREE bn-1 ..

an-1

bl2

b0

bl1-1 ..

bl1

bl2-1

al1 al1-1 a0

al2 ..

al2-1 ..

..

15

REFERENCE

BINARY FIELD MULTIPLICATION

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 20, NO. 3, MARCH 2012 449 Toeplitz Matrix Approach for Binary Field Multiplication Using Quadrinomials . M. Anwar Hasan, Ashkan Hosseinzadeh Namin, and Christophe Negre O. Ahmadi and A. Menezes, Irreducible polynomials of maximum weight, Utilitas Math., vol. 72, pp. 111123, 2007.. W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Trans. Inf.Theory, vol. 24, no. 6, pp. 644654, Nov. 1976. C. Doche, Redundant trinomials for finite fields of characteristic 2, in Proc. ACISP, 2005, pp. 122133. H. Fan and M. A. Hasan, A new approach to sub-quadratic space complexity parallel multipliers for extended binary fields, IEEE Trans.Comput., vol. 56, no. 2, pp. 224233, Sep. 2007. M. A. Hasan and C. Negre, Subquadratic space complexity multiplier for a class of binary fields using toeplitz matrix approach, in Proc. 19th IEEE Symp. Comput. Arithmet. (ARITH19), Jun. 2009, pp. 6775.
16

17

18