Results 1  10
of
1,472,909
DiffieHellman without Difficulty
"... Abstract. An excellent way for a protocol to obtain shared keys is DiffieHellman. For the automated verification of security protocols, the use of DiffieHellman poses a certain amount of difficulty, because it requires algebraic reasoning. Several tools work in the free algebra and even for tools ..."
Abstract
 Add to MetaCart
Abstract. An excellent way for a protocol to obtain shared keys is DiffieHellman. For the automated verification of security protocols, the use of DiffieHellman poses a certain amount of difficulty, because it requires algebraic reasoning. Several tools work in the free algebra and even for tools
The DiffieHellman Protocol
 DESIGNS, CODES, AND CRYPTOGRAPHY
, 1999
"... The 1976 seminal paper of Diffie and Hellman is a landmark in the history of cryptography. They introduced the fundamental concepts of a trapdoor oneway function, a publickey cryptosystem, and a digital signature scheme. Moreover, they presented a protocol, the socalled DiffieHellman protoco ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
The 1976 seminal paper of Diffie and Hellman is a landmark in the history of cryptography. They introduced the fundamental concepts of a trapdoor oneway function, a publickey cryptosystem, and a digital signature scheme. Moreover, they presented a protocol, the socalled DiffieHellman
On the Difficulty of Breaking the DiffieHellman Protocol
, 1995
"... Let G be a cyclic group with generator g and order jGj with known factorization. We prove that, given an appropriate auxiliary group H p for each large prime factor p of jGj, breaking the DiffieHellman protocol and computing discrete logarithms are polynomialtime equivalent for G. Appropriate au ..."
Abstract
 Add to MetaCart
Let G be a cyclic group with generator g and order jGj with known factorization. We prove that, given an appropriate auxiliary group H p for each large prime factor p of jGj, breaking the DiffieHellman protocol and computing discrete logarithms are polynomialtime equivalent for G. Appropriate
Modification of DiffieHellman . . .
, 2013
"... DiffieHellman algorithm is one of the first schemes proposed for the exchange of keys required in asymmetric encryption. It was developed by Whitfield Diffie and Martin Hellman in 1976. This algorithm removes the need of transferring keys between two communicating parties. It enables each party to ..."
Abstract
 Add to MetaCart
DiffieHellman algorithm is one of the first schemes proposed for the exchange of keys required in asymmetric encryption. It was developed by Whitfield Diffie and Martin Hellman in 1976. This algorithm removes the need of transferring keys between two communicating parties. It enables each party
Curve25519: new DiffieHellman speed records
 In Public Key Cryptography (PKC), SpringerVerlag LNCS 3958
, 2006
"... Abstract. This paper explains the design and implementation of a highsecurity ellipticcurveDiffieHellman function achieving recordsetting speeds: e.g., 832457 Pentium III cycles (with several side benefits: free key compression, free key validation, and stateoftheart timingattack protection) ..."
Abstract

Cited by 111 (24 self)
 Add to MetaCart
Abstract. This paper explains the design and implementation of a highsecurity ellipticcurveDiffieHellman function achieving recordsetting speeds: e.g., 832457 Pentium III cycles (with several side benefits: free key compression, free key validation, and stateoftheart timingattack protection
A TPM DiffieHellman Oracle
, 2013
"... This note describes a DiffieHellman oracle, constructed using standard Trusted Platform Module (TPM) signature APIs. The oracle allows one to compute the exponentiation of an arbitrary group element to a specified TPMprotected private key. By employing the oracle, the security provided by a group ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This note describes a DiffieHellman oracle, constructed using standard Trusted Platform Module (TPM) signature APIs. The oracle allows one to compute the exponentiation of an arbitrary group element to a specified TPMprotected private key. By employing the oracle, the security provided by a group
Matrix Analogues of the DiffieHellman Protocol
"... Abstract. This paper presents a comparative analysis of several matrix analogs of the DiffieHellman algorithm, namely, YeroshSkuratov and Megrelishvili protocols, as well as alternative protocols based on irreducible polynomials and primitive Galois or Fibonacci matrices. Binary matrix is primitiv ..."
Abstract
 Add to MetaCart
Abstract. This paper presents a comparative analysis of several matrix analogs of the DiffieHellman algorithm, namely, YeroshSkuratov and Megrelishvili protocols, as well as alternative protocols based on irreducible polynomials and primitive Galois or Fibonacci matrices. Binary matrix
Authenticated DiffieHellman Key Agreement Protocols
, 1998
"... This paper surveys recent work on the design and analysis of key agreement protocols that are based on the intractability of the DiffieHellman problem. The focus is on protocols that have been standardized, or are in the process of being standardized, by organizations such as ANSI, IEEE, ISO/IEC, a ..."
Abstract

Cited by 82 (1 self)
 Add to MetaCart
This paper surveys recent work on the design and analysis of key agreement protocols that are based on the intractability of the DiffieHellman problem. The focus is on protocols that have been standardized, or are in the process of being standardized, by organizations such as ANSI, IEEE, ISO
Provably secure passwordauthenticated key exchange using DiffieHellman
, 2000
"... Abstract. When designing passwordauthenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow any information to be leaked that would allow verification of the password (a weak shared key), since an attacker who ob ..."
Abstract

Cited by 189 (12 self)
 Add to MetaCart
obtains this information may be able to run an offline dictionary attack to determine the correct password. We present a new protocol called PAK which is the first DiffieHellmanbased passwordauthenticated key exchange protocol to provide a formal proof of security (in the random oracle model) against
DiffieHellman
, 2010
"... ◮ Asymmetric or publickey cryptography ◮ Originally attributed to Diffie and Hellman in 1975, but later discovered in British classified work of James Ellis in 1971 ◮ Basic idea involves altering traditional symmetry of cryptographic protocols to convey additional info in a public key. The message ..."
Abstract
 Add to MetaCart
◮ Asymmetric or publickey cryptography ◮ Originally attributed to Diffie and Hellman in 1975, but later discovered in British classified work of James Ellis in 1971 ◮ Basic idea involves altering traditional symmetry of cryptographic protocols to convey additional info in a public key. The message
Results 1  10
of
1,472,909