2017Unpublished venueRequires access

Investigation into the elliptic curve cryptography

Xianjin Fang, Yan-Ting Wu

Open publisher page 22 citations

Abstract

Elliptic curve cryptography (ECC) in TLS, PGP and SSH, which are just three of the main technologies on which the modern web and IT world are based. However, Compared with RSA public key algorithm, ECC is mysterious and not understandable to most. Few literatures introduce how to partition the plaintext into blocks for ECC and how to map the digital codes of block into the points over elliptic curve. For the arithmetic of the points over elliptic curve, the algorithm of multiples of points is the most crucial, how to optimize this algorithm and perform its time complexity analysis are very important. This paper addresses the above works about ECC, and illustrates an example of ECC encryption algorithm implementation.

About this research paper

What this paper is about

Elliptic curve cryptography (ECC) in TLS, PGP and SSH, which are just three of the main technologies on which the modern web and IT world are based. However, Compared with RSA public key algorithm, ECC is mysterious and not understandable to most. Few literatures introduce how to partition the plaintext into blocks for ECC and how to map the digital codes of block into the points over elliptic curve. For the arithmetic of the points over elliptic curve, the algorithm of multiples of points is the most crucial, how to optimize this algorithm and perform its time complexity analysis are very important. This paper addresses the above works about ECC, and illustrates an example of ECC encryption algorithm implementation.

Why it matters

OpenAlex reports 22 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

Elliptic curve cryptography (ECC) in TLS, PGP and SSH, which are just three of the main technologies on which the modern web and IT world are based. However, Compared with RSA public key algorithm, ECC is mysterious and not understandable to most. Few literatures introduce how to partition the plaintext into blocks for ECC and how to map the digital codes of block into the points over elliptic curve. For the arithmetic of the points over elliptic curve, the algorithm of multiples of points is the most crucial, how to optimize this algorithm and perform its time complexity analysis are very important. This paper addresses the above works about ECC, and illustrates an example of ECC encryption algorithm implementation.

Key concepts: Elliptic curve cryptography, Elliptic Curve Digital Signature Algorithm, Plaintext, Curve25519, Elliptic curve, Key size, Computer science, Public-key cryptography

Related papers

Back to paper searchBrowse research topicsOriginal source
Investigation into the elliptic curve cryptography — Research Paper | ScholarLens