Results 161 to 170 of about 6,041 (213)

Variations of Diffie-Hellman Problem

open access: yesLecture Notes in Computer Science, 2003
This paper studies various computational and decisional Diffie-Hellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational Diffie-Hellman problem: square Diffie-Hellman problem, inverse Diffie-Hellman problem and divisible Diffie-Hellman problem, are equivalent with optimal ...
Robert H Deng   +2 more
exaly   +4 more sources

On the Distribution of the Diffie–Hellman Pairs

open access: yesFinite Fields and Their Applications, 2002
Let \(F_{p}\) be a prime field of \(p\) elements and \(g\) be an element of \(F_{p}\) with multiplicative order \(t\) modulo \(p\). The security of the Diffie-Hellman scheme is based on the complexity of solving \(x\) mod \(t\) given \(g^{x}\bmod p\).
Igor E Shparlinski
exaly   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups

Journal of Cryptology, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antoine Joux, Joux Antoine
exaly   +3 more sources

The Diffie–Hellman Protocol

Designs, Codes and Cryptography, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ueli M. Maurer, Stefan Wolf 0001
openaire   +1 more source

A Quantum Diffie-Hellman Protocol

2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems, 2014
In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations. Qubits rotated by secret rotation angles and exchanged over a quantum channel are appropriately measured to form a secret shared key.
Pranav Subramaniam, Abhishek Parakh
openaire   +1 more source

Diffie-Hellman, decision Diffie-Hellman, and discrete logarithms

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 2002
Let G be a cyclic group of order n. With respect to polynomial-time non-uniform generic reductions, the Diffie-Hellman problem and the discrete logarithm problem are equivalent in G if and only if n contains no multiple large prime factors. The Diffie-Hellman decision problem is equivalent to the Diffie-Hellman problem in G if and only if all prime ...
U. Maurer, S. Wolf
openaire   +1 more source

Home - About - Disclaimer - Privacy