A novel polynomial basis multiplier for arbitrary elliptic curves over GF (2&lt;sup&gt;m&lt;/sup&gt;)

Mosin, Abdul; V. R. Ravindra, J.

doi:10.1109/i2ct.2014.7092022

Public

A novel polynomial basis multiplier for arbitrary elliptic curves over GF (2<sup>m</sup>)

Published • Apr 1, 2014

Authors:

Abdul Mosin

J. V. R. Ravindra

Abstract

Finite field GF (2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> ) arithmetic plays a crucial role in applications like Computer algebra, Coding theory and Elliptic Curve Cryptography (ECC). The GF (2 <sup xmlns:mml="http://www.w3.org/1998/Mat...

View

Paywalled

Subject

Discrete mathematics

Arithmetic

Combinatorics

Generate AI Take for this paper

Highlights, strengths & weaknesses, commercial applications, and societal impact — written for this paper on demand.

Subject

Generate AI Take for this paper

Discussions