Algorithm for squaring in GF(2m) in standard basis

DOI10.1049/EL:19890846MaRDI QIDQ3203112zbMATH OpenOpenAlexFDO

Authors M. Piontas

Publication date 1989

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19890846

zbMATH Keywords

effective algorithm for squaringfinite fieldstandard basis

Mathematics Subject Classification ID

Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Recommendations

• Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)
• Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
• scientific article; zbMATH DE number 1796971
• An efficient algorithm for computing inverses in \(\text{GF}(2^{m})\) using dual bases
• Arithmetic operations in \(GF(2^ m)\)

This page was built for publication: Algorithm for squaring in GF(2m) in standard basis

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