Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields

This short paper summarizes our recent results on construction of low-complexity bit-parallel finite field multiplier using polynomial basis. The complexity and time delay of the proposed multipliers are lower than those of the similar proposals.

Uložené v:
Podrobná bibliografia
Vydané v:2006 International Conference on Communications, Circuits, and Systems proceedings : Guilin University of Electronic Technology (GUET), Guilin Bravo Hotel, Guilin, China, June 25-28, 2006 Ročník 4; s. 2565 - 2568
Hlavný autor: Huapeng Wu
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.06.2006
Predmet:
Arithmetic
Concurrent computing
Delay effects
Design optimization
Elliptic curve cryptography
Galois fields
Logic
Polynomials
Proposals
Very large scale integration
ISBN:9780780395848, 0780395840
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This short paper summarizes our recent results on construction of low-complexity bit-parallel finite field multiplier using polynomial basis. The complexity and time delay of the proposed multipliers are lower than those of the similar proposals.
ISBN:9780780395848
0780395840
DOI:10.1109/ICCCAS.2006.285197