Results 1 to 10 of about 2,843 (216)

The Twin Diffie–Hellman Problem and Applications [PDF]

open access: bronzeJournal of Cryptology, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David M. Cash, Eike Kiltz, Victor Shoup
openalex   +7 more sources

An Alternative Diffie-Hellman Protocol [PDF]

open access: yesCryptography, 2020
The Diffie–Hellman protocol, ingenious in its simplicity, is still the major solution in protocols for generating a shared secret in cryptography for e-trading and many other applications after an impressive number of decades. However, lately, the threat from a future quantum computer has prompted successors resilient to quantum computer-based attacks.
Eric Järpe
openaire   +5 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

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

Secure Bilinear Diffie-Hellman Bits

open access: green, 2004
The Weil and Tate pairings are a popular new gadget in cryptography and have found many applications, including identity-based cryptography. In particular, the pairings have been used for key exchange protocols.
Steven D. Galbraith⋆   +2 more
openalex   +4 more sources

On the index of the Diffie–Hellman mapping [PDF]

open access: yesApplicable Algebra in Engineering, Communication and Computing, 2020
In this paper, the authors determine the index of the univariate Diffie-Hellman mapping \(d(\gamma^a) = \gamma^{a^2}\), \(0 \le a \le n-1\), and \(\gamma\) is a generator of a cyclic group \(G\) of order \(n\). They show that any mapping of small index coincides with \(d\) only on a small subset of \(G\).
Işık Lavrauw, Leyla, Winterhof, Arne
openaire   +2 more sources

An Algebraic Framework for Diffie-Hellman Assumptions [PDF]

open access: yesJournal of Cryptology, 2013
Funded by a Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation and the German Federal Ministry for Education and Research. Partially supported by the Spanish Government through projects MTM2009-07694 and Consolider Ingenio 2010 CDS2007-00004 ARES.
Alex Escala   +4 more
openaire   +14 more sources

Easy Decision Diffie-Hellman Groups [PDF]

open access: yesLMS Journal of Computation and Mathematics, 2004
AbstractThe decision Diffie-Hellman problem (DDH) is a central computational problem in cryptography. It is known that the Weil and Tate pairings can be used to solve many DDH problems on elliptic curves. Distortion maps are an important tool for solving DDH problems using pairings, and it is known that distortion maps exist for all super-singular ...
Steven D. Galbraith, Victor Rotger
openaire   +3 more sources

Home - About - Disclaimer - Privacy