AbstractElliptic curves over finite fields have found applications in many areas including cryptography. In the current work we define a metric on the set of elliptic curves defined over a prime field Fp, p>3. Computing this metric requires us to solve an instance of a discrete log problem in Fp∗. This idea may have a possible application in devising some cryptographic primitives
Up to now, very few algorithms exist that solve the discrete logarithm problem in the group of point...
The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric pro...
The objective of this work is to study some properties, results and cryptographic applications of th...
AbstractElliptic curves over finite fields have found applications in many areas including cryptogra...
The goal of this thesis is to study cryptographic applications of elliptic curves over the ring Fp["...
At its core, cryptography relies on problems that are simple to construct but difficult to solve unl...
The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields ...
In the recent years, the need of information security has rapidly increased due to an enormous growt...
Cryptographic protocols often make use of the inherent hardness of the classical discrete logarithm ...
With the dramatically increasing volume of sensitive information being transmitted wirelessly via th...
This thesis is a basic overview of elliptic curves and their applications to Cryptography. We begin ...
The use of finite fields of low characteristic can make the implementation of elliptic curve cryptog...
AbstractAlgebraic curves over finite fields are being extensively used in the design of public-key c...
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statem...
Many elliptic curve cryptosystems require an encoding function from a finite field Fq into Fq-rational...
Up to now, very few algorithms exist that solve the discrete logarithm problem in the group of point...
The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric pro...
The objective of this work is to study some properties, results and cryptographic applications of th...
AbstractElliptic curves over finite fields have found applications in many areas including cryptogra...
The goal of this thesis is to study cryptographic applications of elliptic curves over the ring Fp["...
At its core, cryptography relies on problems that are simple to construct but difficult to solve unl...
The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields ...
In the recent years, the need of information security has rapidly increased due to an enormous growt...
Cryptographic protocols often make use of the inherent hardness of the classical discrete logarithm ...
With the dramatically increasing volume of sensitive information being transmitted wirelessly via th...
This thesis is a basic overview of elliptic curves and their applications to Cryptography. We begin ...
The use of finite fields of low characteristic can make the implementation of elliptic curve cryptog...
AbstractAlgebraic curves over finite fields are being extensively used in the design of public-key c...
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statem...
Many elliptic curve cryptosystems require an encoding function from a finite field Fq into Fq-rational...
Up to now, very few algorithms exist that solve the discrete logarithm problem in the group of point...
The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric pro...
The objective of this work is to study some properties, results and cryptographic applications of th...
DOI
Add to ORKG