Low-complexity versatile finite field multiplier in normal basis (Q1773590): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 07:38, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Low-complexity versatile finite field multiplier in normal basis |
scientific article |
Statements
Low-complexity versatile finite field multiplier in normal basis (English)
0 references
3 May 2005
0 references
Summary: A low-complexity VLSI array of versatile multiplier in normal basis over \(\text{GF}(2^n)\) is presented. The finite field parameters can be changed according to the user's requirement and make the multiplier reusable in different applications. It increases the flexibility to use the same multiplier for different applications and reduces the user's cost. The proposed multiplier has a regular structure and is very suitable for high speed VLSI implementation. In addition, the pipeline versatile multiplier can be modified to a low-cost architecture which is feasible in embedded systems and restricted computing environments.
0 references
VLSI array of versatile multiplier
0 references