Low complexity bit-parallel multipliers for a class of finite fields

New implementations of bit-parallel multipliers for a class of finite fields are proposed. The class of finite fields is constructed with irreducible AOPs (all one polynomials) and ESPs (equally spaced polynomials). The size and time complexities of our proposed multipliers are lower than or equal t...

Full description

Bibliographic Details

Published in:	IEEE transactions on computers Vol. 47; no. 8; pp. 883 - 887
Main Authors:	Huapeng Wu, Hasan, M.A.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.08.1998 Institute of Electrical and Electronics Engineers
Subjects:	Applied sciences Cryptography Design. Technologies. Operation analysis. Testing Electronics Electrostatic precipitators Exact sciences and technology Galois fields Integrated circuits Message-oriented middleware Polynomials Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices Integrated circuits Multiplier Finite field Implementation
ISSN:	0018-9340
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!