Generalised fast algorithm for computing multiplicative inverses inGF(2m)
From MaRDI portal
Publication:4206833
DOI10.1049/el:19890449zbMath0688.12009OpenAlexW2125688582MaRDI QIDQ4206833
No author found.
Publication date: 1989
Published in: Electronics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1049/el:19890449
Analysis of algorithms and problem complexity (68Q25) Finite fields and commutative rings (number-theoretic aspects) (11T99) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (2)
Computing special powers in finite fields ⋮ HECC Goes Embedded: An Area-Efficient Implementation of HECC
This page was built for publication: Generalised fast algorithm for computing multiplicative inverses inGF(2m)