2015•Unpublished venueRequires access

Speeding up the Elliptic Curve Scalar Multiplication Using the

Mohamad Rushdan

Abstract

Nowadays, elliptic curve based cryptosystem is an efficient public key cryptosystem, The very expensive operation in this cryptographic protocol is the elliptic curve scalar multiplication (elliptic curve point multiplication). Efforts have been mainly focused on developing efficient algorithms for representing the scalar which is involved of elliptic curve scalar multiplication. One of these is using the windoww

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 point multiplication, Elliptic curve cryptography, Curve25519, Hessian form of an elliptic curve, Elliptic curve, Elliptic Curve Digital Signature Algorithm, Schoof's algorithm