2006•Jisuanji gongcheng yu shejiRequires access

Fast implementation of elliptic curves cryptosystem over GF(2~m)

Haiqin Zhang

Abstract

Fast implementation of elliptic curves cryptography is one of hot research spots in current public key cryptosystems.Scalar multiplication and point addition in elliptic curves are core operations in elliptic curve cryptosystem.In order to accelerate operating speed,projective coordinates are used and point addition is improved to optimize the scalar multiplication algorithm.The superiority of elliptic curve cryptography is discussed,and the significance of fast implementation is studied.

About this research paper

What this paper is about

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

Key concepts: Scalar multiplication, Elliptic curve cryptography, Elliptic curve point multiplication, Elliptic curve, Computer science, Elliptic Curve Digital Signature Algorithm, Hessian form of an elliptic curve, Tripling-oriented Doche–Icart–Kohel curve