Results 1  10
of
455,271
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
Variations of diffiehellman problem
 In ICICS ’03, volume 2836 of LNCS
, 2003
"... Abstract. This paper studies various computational and decisional DiffieHellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational DiffieHellman problem: square DiffieHellman problem, inverse DiffieHellman problem and d ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
Abstract. This paper studies various computational and decisional DiffieHellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational DiffieHellman problem: square DiffieHellman problem, inverse DiffieHellman problem
On the Security of DiffieHellman Bits
, 2000
"... Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element α of a finite field IFp of p elements from rather short strings of the most significant bits of the remainder modulo p of ..."
Abstract

Cited by 23 (11 self)
 Add to MetaCart
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element α of a finite field IFp of p elements from rather short strings of the most significant bits of the remainder modulo p of
On the Security of Diffie–Hellman Bits
"... Abstract. Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a “hidden ” element α of a finite field IFp of p elements from rather short strings of the most significant bits of the remainder modulo p of αt for several values of t selected uniformly at random from ..."
Abstract
 Add to MetaCart
fixed ε> 0. We also use this generalization to improve (and correct) one of the statements of the aforementioned work about the computational security of the most significant bits of the Diffie–Hellman key. 1.
DiffieHellman Key Exchange
"... Abstract Oblivious Transfer (OT) is the fundamental building block of cryptographic protocols. In this paper we describe the simplest and most efficient protocol for 1outof2 OT to date, which is obtained by tweaking the DiffieHellman keyexchange protocol. The protocol achieves UCsecurity again ..."
Abstract
 Add to MetaCart
Abstract Oblivious Transfer (OT) is the fundamental building block of cryptographic protocols. In this paper we describe the simplest and most efficient protocol for 1outof2 OT to date, which is obtained by tweaking the DiffieHellman keyexchange protocol. The protocol achieves UC
DISCRETE LOGARITHMS, DIFFIEHELLMAN, AND REDUCTIONS
"... Abstract. We consider the OnePrimeNotp and AllPrimesButp variants of the Discrete Logarithm (DL) problem in a group of prime order p. We give reductions to the DiffieHellman (DH) problem that do not depend on any unproved conjectures about smooth or prime numbers in short intervals. We show t ..."
Abstract
 Add to MetaCart
Abstract. We consider the OnePrimeNotp and AllPrimesButp variants of the Discrete Logarithm (DL) problem in a group of prime order p. We give reductions to the DiffieHellman (DH) problem that do not depend on any unproved conjectures about smooth or prime numbers in short intervals. We show
On the Complexity of Breaking the DiffieHellman Protocol
 Computer Science Department
, 1996
"... It is shown that for a class of finite groups, breaking the DiffieHellman protocol is polynomialtime equivalent to computing discrete logarithms. Let G be a cyclic group with generator g and order jGj whose prime factorization is known. When for each large prime factor p of jGj an auxiliary group ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
It is shown that for a class of finite groups, breaking the DiffieHellman protocol is polynomialtime equivalent to computing discrete logarithms. Let G be a cyclic group with generator g and order jGj whose prime factorization is known. When for each large prime factor p of jGj an auxiliary group
On the bit security of the DiffieHellman key
 In Appl. Algebra in Engin., Commun. and Computing
, 2006
"... Let IFp be a finite field of p elements, where p is prime. The bit security of the DiffieHellman function over subgroups of IF ∗ p and of an elliptic curve over IFp, is considered. It is shown that if the Decision DiffieHellman problem is hard in these groups, then the two most significant bits of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let IFp be a finite field of p elements, where p is prime. The bit security of the DiffieHellman function over subgroups of IF ∗ p and of an elliptic curve over IFp, is considered. It is shown that if the Decision DiffieHellman problem is hard in these groups, then the two most significant bits
Outline Background RSA 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
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
Results 1  10
of
455,271