Add to ORKGpeer reviewedWe describe a public key cryptosystem which works in quadratic function fields of characteristic two. Formulas for arithmetic are explicitly given. The security of the system is based on the discrete logarithm problem in these fields. Therefore we also describe a Discrete Logarithm algorithm based on the ideas of Pohlig and Hellman, especially adopted to quadratic function fields of characteristic two
In the paper we try to give a view of the discrete logarithm problem, especially of related problems...
Computing discrete logarithms is a long-standing algorithmic problem, whose hardness forms the basis...
Abstract:- The system we propose is a mathematical problem with the necessary properties to define p...
We present a key exchange scheme similar to that of Diffie and Hellman using the infrastructure of q...
We describe implementations for solving the discrete logarithm problem in the class group of an imag...
The discrete logarithm problem is one of the few hard problems on which public-key cryptography can ...
The purpose of this thesis is to study the complexity of the discrete logarithm problem (DLP) and re...
Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the discrete loga...
In public-key cryptography the discrete logarithm has gained increasing interest as a one-way functi...
Abstract The first practical public key cryptosystem ever published, the Diffie-Hellman key exchange...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
The field of cryptography (from the Greek kryptos, meaning “hidden ” and graphein, meaning “to write...
Abstract-A new signature scheme is proposed, together with an imple-mentation of the Diffie-Hellman ...
The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness th...
La cryptologie consiste en l’étude des techniques utilisées par deux entités pour communiquer en ...
In the paper we try to give a view of the discrete logarithm problem, especially of related problems...
Computing discrete logarithms is a long-standing algorithmic problem, whose hardness forms the basis...
Abstract:- The system we propose is a mathematical problem with the necessary properties to define p...
We present a key exchange scheme similar to that of Diffie and Hellman using the infrastructure of q...
We describe implementations for solving the discrete logarithm problem in the class group of an imag...
The discrete logarithm problem is one of the few hard problems on which public-key cryptography can ...
The purpose of this thesis is to study the complexity of the discrete logarithm problem (DLP) and re...
Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the discrete loga...
In public-key cryptography the discrete logarithm has gained increasing interest as a one-way functi...
Abstract The first practical public key cryptosystem ever published, the Diffie-Hellman key exchange...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
The field of cryptography (from the Greek kryptos, meaning “hidden ” and graphein, meaning “to write...
Abstract-A new signature scheme is proposed, together with an imple-mentation of the Diffie-Hellman ...
The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness th...
La cryptologie consiste en l’étude des techniques utilisées par deux entités pour communiquer en ...
In the paper we try to give a view of the discrete logarithm problem, especially of related problems...
Computing discrete logarithms is a long-standing algorithmic problem, whose hardness forms the basis...
Abstract:- The system we propose is a mathematical problem with the necessary properties to define p...