A modified low complexity digit-level Gaussian normal basis multiplier

DOI10.1007/978-3-642-13797-6_3MaRDI QIDQ3578463zbMATH OpenOpenAlexFDO

Authors Reza Azarderakhsh, Arash Reyhani-Masoleh

Publication date 20 July 2010

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13797-6_3

zbMATH Keywords

complexity reductiondigit-serial multiplierfinite fieldGaussian normal basis

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Mathematical problems of computer architecture (68M07) Symbolic computation and algebraic computation (68W30) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Modified Serial Multipliers for Type-IV Gaussian Normal Bases
• Two normal basis multiplication algorithms for GF(2n)
• Efficient linear array for multiplication in GF\((2^{m})\) using a normal basis for elliptic curve cryptography
• Information Security and Cryptology - ICISC 2005
• Low-complexity multiplexer-based normal basis multiplier over GF(2ᵐ)

Cited in

(4)

• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• Efficient linear array for multiplication in GF\((2^{m})\) using a normal basis for elliptic curve cryptography
• Two normal basis multiplication algorithms for GF(2n)
• Modified Serial Multipliers for Type-IV Gaussian Normal Bases

This page was built for publication: A modified low complexity digit-level Gaussian normal basis multiplier

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