Results 181 to 190 of about 2,843 (216)

The square root Diffie–Hellman problem

Designs, Codes and Cryptography, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongyoung Roh, Sang Geun Hahn
openaire   +3 more sources

A Polynomial Representation of the Diffie-Hellman Mapping

Applicable Algebra in Engineering, Communication and Computing, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wilfried Meidl, Arne Winterhof
openaire   +1 more source

A Note on Twin Diffie-Hellman Problem

2009 International Conference on Computational Intelligence and Security, 2009
Recently Cash, Kiltz and Shoup [5] proposed a new computational problem called twin Diffie-Hellman problem. This paper investigates properties of the trapdoor test introduced in [5]. Secondly this paper presents some new relations between the twin Diffie-Hellman problem and the Diffie-Hellman problem.
Mingqiang Wang, Leibo Li
openaire   +1 more source

Decidability for Lightweight Diffie-Hellman Protocols

2014 IEEE 27th Computer Security Foundations Symposium, 2014
Many protocols use Diffie-Hellman key agreement, combined with certified long-term values or digital signatures for authentication. These protocols aim at security goals such as key secrecy, forward secrecy, resistance to key compromise attacks, and various flavors of authentication.
Daniel J. Dougherty, Joshua D. Guttman
openaire   +1 more source

Diffie-Hellman without Difficulty

2012
An excellent way for a protocol to obtain shared keys is Diffie-Hellman. For the automated verification of security protocols, the use of Diffie-Hellman poses a certain amount of difficulty, because it requires algebraic reasoning. Several tools work in the free algebra and even for tools that do support Diffie-Hellman, the algebraic reasoning becomes ...
openaire   +1 more source

The Decision Diffie-Hellman problem

1998
The Decision Diffie-Hellman assumption (ddh) is a gold mine. It enables one to construct efficient cryptographic systems with strong security properties. In this paper we survey the recent applications of DDH as well as known results regarding its security. We describe some open problems in this area.
openaire   +1 more source

The probability Distribution of the Diffie-Hellman Key

1993
The probability distribution of the key generated by the Diffie-Hellman Public Key-Distribution system is derived. For different prime factorizations of p−1, where p is the prime modulus of the Diffie-Hellman system, the probabilities of the most and the least likely Diffie-Hellman key are found.
Christian Waldvogel, James L. Massey
openaire   +1 more source

A Fast Diffie—Hellman Protocol in Genus 2

Journal of Cryptology, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Smart, N P, Siksek, S
openaire   +1 more source

Interpolation of the Elliptic Curve Diffie-Hellman Mapping

2003
We prove lower bounds on the degree of polynomials interpolating the Diffie-Hellman mapping for elliptic curves over finite fields and some related mappings including the discrete logarithm. Our results support the assumption that the elliptic curve Diffie-Hellman key exchange and related cryptosystems are secure.
Lange, T., Winterhof, A.
openaire   +2 more sources

A One Round Protocol for Tripartite Diffie–Hellman

Journal of Cryptology, 2000
The paper studies an analog of the Diffie-Hellman protocol that involves three participants, A, B and C. It requires a single pass of communication and allows a common secret to be constructed. The main idea is to start from some elliptic curve and some torsion point.
openaire   +1 more source