Bit-level pipelined digit serial GF(2m) multiplier
A low latency digit serial multiplier for GF(2m) that can be pipelined to the bit-level is presented in this paper. Unlike existing structures, the new multiplier does not put any restriction on the type of generator polynomial used or the digit size. Furthermore, the latency of the new multiplier i...
Saved in:
| Main Author: | Ibrahim, M.K. (author) |
|---|---|
| Other Authors: | Almulhem, A. (author), unknown (author) |
| Format: | article |
| Published: |
2001
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14133/1/14133_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14133/2/14133_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fast elliptic curve cryptographic processor architecture based on three parallel GF(2/sup k/) bit level pipelined digit serial multipliers
by: Gutub, A.A.-A.
Published: (2003) -
GF(2 K) elliptic curve cryptographic processor architecture based n bit level pipelined digit serial multiplication
by: Gutub, A.A.-A.
Published: (2003) -
Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers
by: Al-Somani, Turki Faisal
Published: (2006) -
Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers
by: Gutub, Adnan
Published: (2006) -
High Performance Elliptic Curve GF(2m) Crypto-processor
by: Al-Somani, Turki Faisal
Published: (2006)