GF(2n) bit-parallel squarer using generalised polynomial basis for new class of irreducible pentanomials

Explicit formulae and complexities of bit-parallel GF(2n) squarers for a new class of irreducible pentanomials xn + xn−1 + xk + x + 1, where n is odd and 1 < k < (n − 1)/2 are presented. The squarer is based on the generalised polynomial basis of GF(2n). Its gate delay matches the best results...

Full description

Saved in:

Bibliographic Details
Published in:	Electronics letters Vol. 50; no. 9; pp. 655 - 657
Main Authors:	Xiong, Xi, Fan, Haining
Format:	Journal Article
Language:	English
Published:	Stevenage The Institution of Engineering and Technology 24.04.2014 Institution of Engineering and Technology John Wiley & Sons, Inc
Subjects:	Algebra Applied sciences Circuits and systems Complexity Delay Electronics Exact sciences and technology Field theory and polynomials gate delay Gates generalised polynomial basis GF(2n) bit‐parallel squarer Integrated circuits Integrated circuits by function (including memories and processors) irreducible pentanomial logic gates Mathematics Polynomials Sciences and techniques of general use Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices XOR gate logic gates polynomials XOR gate generalised polynomial basis GF(2n) bit-parallel squarer gate delay irreducible pentanomial Polynomial Arithmetic circuit Galois algebra Irreducible operator Parallel processing Logic gate Delay Complexity
ISSN:	0013-5194, 1350-911X, 1350-911X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!