Fast Inversion in <formula formulatype="inline"><tex Notation="TeX">${\schmi{GF(2^m)}}$</tex></formula> with Normal Basis Using Hybrid-Double Multipliers

DOI10.1109/TC.2012.265zbMath1364.65307OpenAlexW2207288751MaRDI QIDQ5268255

Kimmo Järvinen, Reza Azarderakhsh, Vassil S. Dimitrov

Publication date: 20 June 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2012.265

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (2)

Concrete quantum cryptanalysis of binary elliptic curves via addition chain ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: Fast Inversion in <formula formulatype="inline"><tex Notation="TeX">${\schmi{GF(2^m)}}$</tex></formula> with Normal Basis Using Hybrid-Double Multipliers