Complexity Reduction of Constant Matrix Computations over the Binary Field

DOI10.1007/978-3-540-73074-3_9MaRDI QIDQ5426084zbMATH OpenOpenAlexFDO

Authors Oscar Gustafsson, Mikael Olofsson

Publication date 15 November 2007

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

Full work available at URL https://doi.org/10.1007/978-3-540-73074-3_9

zbMATH Keywords

binary fieldconstant multiplicationGalois field arithmeticlow-complexity

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Mathematical problems of computer architecture (68M07) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Reducing the complexity of normal basis multiplication
• A framework to optimize implementations of matrices
• Lightweight multiplication in \(\mathrm{GF}(2^n)\) with applications to MDS matrices
• Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
• Algorithm 898

Cited in

(3)

• On the subfield subcodes of Hermitian codes
• Reducing the number of operations in certain finite- field transforms (Corresp.)
• A framework to optimize implementations of matrices

This page was built for publication: Complexity Reduction of Constant Matrix Computations over the Binary Field

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