2005Journal of Jinling Institute of TechnologyRequires access

Fast Elliptic Curve Arithmetic Over the Field of GF(2~n)

Limin Shen

Open publisher page 0 citations

Abstract

Abstrcat We apply some fast elliptic curve arithmetic from the field GF(3~n) to GF(2~n). This is achieved by eliminating not only a field multiplication but also a field division. When we compute 2P+Q from the given points P, Q on the curve, then we can accelerate the speed of computation.

About this research paper

What this paper is about

Abstrcat We apply some fast elliptic curve arithmetic from the field GF(3~n) to GF(2~n). This is achieved by eliminating not only a field multiplication but also a field division. When we compute 2P+Q from the given points P, Q on the curve, then we can accelerate the speed of computation.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstrcat We apply some fast elliptic curve arithmetic from the field GF(3~n) to GF(2~n). This is achieved by eliminating not only a field multiplication but also a field division. When we compute 2P+Q from the given points P, Q on the curve, then we can accelerate the speed of computation.

Key concepts: Arithmetic, Elliptic curve point multiplication, Mathematics, Elliptic curve, Division (mathematics), Hessian form of an elliptic curve, Multiplication (music), Jacobian curve

Related papers

Back to paper searchBrowse research topicsOriginal source
Fast Elliptic Curve Arithmetic Over the Field of GF(2~n) — Research Paper | ScholarLens