ScholarLens Back to search
2016•SUNScholar (Stellenbosch University)Requires access

Elliptic curve cryptography

Gerard Jacques Louw

Open publisher page 0 citations

Abstract

ENGLISH ABSTRACT : In this thesis we present a selection of Diffie-Hellman cryptosystems, which were classically formulated using the multiplicative group of a finite field, but which may be generalised to use other group varieties such as elliptic curves. We also describe known attacks on special cases of such cryptosystems, which manifest as solutions to the discrete logarithm problem for group varieties, and the elliptic curve discrete logarithm problem in particular. We pursue a computational approach throughout, with a focus on the development of practical algorithms.

About this research paper

What this paper is about

ENGLISH ABSTRACT : In this thesis we present a selection of Diffie-Hellman cryptosystems, which were classically formulated using the multiplicative group of a finite field, but which may be generalised to use other group varieties such as elliptic curves. We also describe known attacks on special cases of such cryptosystems, which manifest as solutions to the discrete logarithm problem for group varieties, and the elliptic curve discrete logarithm problem in particular. We pursue a computational approach throughout, with a focus on the development of practical algorithms.

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

ENGLISH ABSTRACT : In this thesis we present a selection of Diffie-Hellman cryptosystems, which were classically formulated using the multiplicative group of a finite field, but which may be generalised to use other group varieties such as elliptic curves. We also describe known attacks on special cases of such cryptosystems, which manifest as solutions to the discrete logarithm problem for group varieties, and the elliptic curve discrete logarithm problem in particular. We pursue a computational approach throughout, with a focus on the development of practical algorithms.

Key concepts: Elliptic curve cryptography, Cryptography, Elliptic curve, Mathematics, Computer science, Computer security, Pure mathematics, Encryption

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Elliptic curve cryptography — Research Paper | ScholarLens