ScholarLens Back to search
2008•Unpublished venueRequires access

Efficient arithmetic on elliptic curves cryptograph

Jing Zhang

Open publisher page 2 citations

Abstract

In 1980s,the theory of elliptic curve was introduced into the field of data cryptography,which formed a new public key cryptograph system,that is elliptic curves cryptography(ECC).The most time consuming operation is multiplication of a point on the elliptic curve with an integer in the system.Therefore,the key of the efficient achievement elliptic curve cryptography is the efficient computing of multiplying points.In the paper,introduce a new computing kP algorithm,and efficiency was improved 38%.

About this research paper

What this paper is about

In 1980s,the theory of elliptic curve was introduced into the field of data cryptography,which formed a new public key cryptograph system,that is elliptic curves cryptography(ECC).The most time consuming operation is multiplication of a point on the elliptic curve with an integer in the system.Therefore,the key of the efficient achievement elliptic curve cryptography is the efficient computing of multiplying points.In the paper,introduce a new computing kP algorithm,and efficiency was improved 38%.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

In 1980s,the theory of elliptic curve was introduced into the field of data cryptography,which formed a new public key cryptograph system,that is elliptic curves cryptography(ECC).The most time consuming operation is multiplication of a point on the elliptic curve with an integer in the system.Therefore,the key of the efficient achievement elliptic curve cryptography is the efficient computing of multiplying points.In the paper,introduce a new computing kP algorithm,and efficiency was improved 38%.

Key concepts: Counting points on elliptic curves, Elliptic curve cryptography, Elliptic curve, Elliptic curve point multiplication, Mathematics, Schoof's algorithm, Hessian form of an elliptic curve, Hyperelliptic curve cryptography

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Efficient arithmetic on elliptic curves cryptograph — Research Paper | ScholarLens