Low-Complexity Bit-Parallel Square Root Computation over GF(2ᵐ) for All Trinomials

DOI10.1109/TC.2007.70822zbMATH Open1388.65207OpenAlexW2161716369MaRDI QIDQ4589560FDOQ4589560

Guillermo Morales Luna, Francisco Rodríguez-Henríquez, Julio López

Publication date: 10 November 2017

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

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

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical algorithms for computer arithmetic, etc. (65Y04)

Cited In (3)

• A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
• Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
• Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials

This page was built for publication: Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials

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