Low-complexity versatile finite field multiplier in normal basis

DOI10.1155/S111086570220414XMaRDI QIDQ1773590zbMATH OpenFDO

Authors Hua Li, Chang Nian Zhang

Publication date 3 May 2005

Published in EURASIP Journal on Applied Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/S111086570220414X

zbMATH Keywords

VLSI array of versatile multiplier

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Data encryption (aspects in computer science) (68P25) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Review text

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.

Recommendations

• Low-complexity multiplexer-based normal basis multiplier over GF(2ᵐ)
• Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
• scientific article; zbMATH DE number 1878331
• A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
• Efficient normal basis multipliers in composite fields

Cited in

(6)

• Low-complexity multiplexer-based normal basis multiplier over GF(2ᵐ)
• Efficient normal basis multipliers in composite fields
• scientific article; zbMATH DE number 1504806 (Why is no real title available?)
• A low-complexity combinatorial RNS multiplier
• Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
• Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases

This page was built for publication: Low-complexity versatile finite field multiplier in normal basis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773590)