On efficient normal basis multiplication

DOI10.1007/3-540-44495-5_19MaRDI QIDQ2707608zbMATH OpenFDO

Authors Arash Reyhani-Masoleh, M. Anwar Hasan

Publication date 16 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44495-5_19

zbMATH Keywords

cryptographyfinite fieldsmultiplication algorithmsnormal basis

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Review text

The authors propose a multiplication algorithm in finite fields of characteristic \(2\). It is especially efficient in the case of composite fields, because it requires a low number of bit operations. For the entire collection see [Zbl 0952.00063].

Recommendations

• scientific article; zbMATH DE number 2142533
• High-speed software multiplication in \(\mathbb{F}_{2^m}\)
• A new algorithm for multiplication in finite fields
• scientific article; zbMATH DE number 1273656
• Fast multiplication in finite fields GF(2N)

Cited in

(10)

• Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\)
• Reducing the complexity of normal basis multiplication
• A new algorithm for multiplication in finite fields
• Efficient multiplication over extension fields
• Efficient normal basis multipliers in composite fields
• Operation-efficient subgroups of finite fields
• Complexity of computation in finite fields
• scientific article; zbMATH DE number 2142533 (Why is no real title available?)
• Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases
• On multiplication tables of optimal normal bases over finite fields

This page was built for publication: On efficient normal basis multiplication

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