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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computers Ročník 47; číslo 8; s. 883 - 887
Hlavní autoři: Huapeng Wu, Hasan, M.A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.08.1998
Institute of Electrical and Electronics Engineers
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 to those of the previously proposed multipliers of the same class.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
DOI:10.1109/12.707588