2012Unpublished venueRequires access

Elliptic Curve Discrete Logarithm Based Cryptography

Song Y. Yan

Open publisher page 0 citations

Abstract

This chapter examines the elliptic curve discrete logarithm-based (ECDLP) pubic-key cryptosystems and digital signatures. These include Elliptic curve Dif?e-Helman-Meerkle key-exchange; Elliptic curve Massey-Omura three-pass protocol; Elliptic curve ElGamal cryptography; Elliptic curve RSA cryptosystem; Menezes-Vanstone elliptic curve cryptography; and Elliptic curve digital signature algorithm (ECDSA). The most widely used RSA crypto system cannot only be used for both encryption and digital signatures, but also has a natural analog of elliptic curve cryptography. The elliptic curve digital signature algorithm (ECDSA) is the elliptic curve analog of the digital signature algorithm (DSA). The chapter also introduces elliptic curve cryptography (ECC) and the digital signature algorithm (ECDSA), whose security are based on the infeasibility of the Elliptic Curve Discrete Logarithm Problem.

About this research paper

What this paper is about

This chapter examines the elliptic curve discrete logarithm-based (ECDLP) pubic-key cryptosystems and digital signatures. These include Elliptic curve Dif?e-Helman-Meerkle key-exchange; Elliptic curve Massey-Omura three-pass protocol; Elliptic curve ElGamal cryptography; Elliptic curve RSA cryptosystem; Menezes-Vanstone elliptic curve cryptography; and Elliptic curve digital signature algorithm (ECDSA). The most widely used RSA crypto system cannot only be used for both encryption and digital signatures, but also has a natural analog of elliptic curve cryptography. The elliptic curve digital signature algorithm (ECDSA) is the elliptic curve analog of the digital signature algorithm (DSA). The chapter also introduces elliptic curve cryptography (ECC) and the digital signature algorithm (ECDSA), whose security are based on the infeasibility of the Elliptic Curve Discrete Logarithm Problem.

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

This chapter examines the elliptic curve discrete logarithm-based (ECDLP) pubic-key cryptosystems and digital signatures. These include Elliptic curve Dif?e-Helman-Meerkle key-exchange; Elliptic curve Massey-Omura three-pass protocol; Elliptic curve ElGamal cryptography; Elliptic curve RSA cryptosystem; Menezes-Vanstone elliptic curve cryptography; and Elliptic curve digital signature algorithm (ECDSA). The most widely used RSA crypto system cannot only be used for both encryption and digital signatures, but also has a natural analog of elliptic curve cryptography. The elliptic curve digital signature algorithm (ECDSA) is the elliptic curve analog of the digital signature algorithm (DSA). The chapter also introduces elliptic curve cryptography (ECC) and the digital signature algorithm (ECDSA), whose security are based on the infeasibility of the Elliptic Curve Discrete Logarithm Problem.

Key concepts: Elliptic Curve Digital Signature Algorithm, Elliptic curve cryptography, Hessian form of an elliptic curve, Elliptic curve point multiplication, Tripling-oriented Doche–Icart–Kohel curve, Hyperelliptic curve cryptography, Modular elliptic curve, Post-quantum cryptography

Related papers

Back to paper searchBrowse research topicsOriginal source
Elliptic Curve Discrete Logarithm Based Cryptography — Research Paper | ScholarLens