Engineering Commons^™

Novel Implementation Of Finite Field Multipliers Over Gf(2m) For Emerging Cryptographic Applications, Nazeem Basha Shaik

Browse all Theses and Dissertations

Cryptographic and coding theory algorithms use arithmetic operations over finite fields. Finite field multiplications over GF(2m) are critical components for these systems. Well known irreducible polynomials are all-one-polynomials (AOP), equally spaced polynomial (ESP), trinomial and pentanomial. Due to its simple structure, AOP based multiplica- tion is easy to implement and hence the AOP based multiplication of variable length can be used as a standard computation core. In this thesis, first of all, we employ low register complexity AOP based systolic multiplication core to propose multiplication over GF(2m) based on NIST recommended pentanomials. The proposed parallel and serial ar- chitectures use …