Fast Elliptic Curve Arithmetic Over the Field of GF(2~n)
Limin Shen
Abstract
Limin Shen
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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