Reducing the complexity of normal basis multiplication

DOI10.1007/978-3-319-16277-5_4MaRDI QIDQ2949472zbMATH OpenOpenAlexFDO

Authors Ömer Eğecioğlu, Çetin Kaya Koç

Publication date 1 October 2015

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

Full work available at URL https://doi.org/10.1007/978-3-319-16277-5_4

Mathematics Subject Classification ID

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

Recommendations

• Low-complexity multiplexer-based normal basis multiplier over GF(2ᵐ)
• Efficient Multiplication Using Type 2 Optimal Normal Bases
• scientific article; zbMATH DE number 1583947
• An efficient optimal normal basis type II multiplier
• A new algorithm for multiplication in finite fields

Cited in

(3)

• Low-complexity multiplexer-based normal basis multiplier over GF(2ᵐ)
• Detecting unnecessary reductions in an involutive basis computation
• Complexity Reduction of Constant Matrix Computations over the Binary Field

This page was built for publication: Reducing the complexity of normal basis multiplication

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