Results 1  10
of
1,778
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
DISCRETE LOGARITHMS, DIFFIEHELLMAN, AND REDUCTIONS
, 2011
"... 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 that the ..."
Abstract
 Add to MetaCart
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 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
DHAES: An Encryption Scheme Based on the DiffieHellman Problem
, 1998
"... This paper describes a DiffieHellman based encryption scheme, DHAES. The scheme is as efficient as ElGamal encryption, but has stronger security properties. Furthermore, these security properties are proven to hold under appropriate assumptions on the underlying primitive. We show that DHAES has no ..."
Abstract

Cited by 61 (5 self)
 Add to MetaCart
This paper describes a DiffieHellman based encryption scheme, DHAES. The scheme is as efficient as ElGamal encryption, but has stronger security properties. Furthermore, these security properties are proven to hold under appropriate assumptions on the underlying primitive. We show that DHAES has
DiffieHellman Protocol Based on Elgamal and AES Cryptosystems
"... Abstract : This paper presents a communication scheme design for securing messages through local area networks (LAN). This scheme implements a hybrid cryptosystem which is formed by AES256 in its symmetric part and ElGamal for encryption of keys where the prime has 400 digits and 200 digits for t ..."
Abstract
 Add to MetaCart
for the alpha primitive. It also applies the DiffieHellman protocol for key secure distribution. This implementation is targeted at senior management members or groups of any corporate trust where the number of users is small. Key distribution requires a number equal to the number of rounds for at least one
The Decisional DiffieHellman Problem and the Uniform Boundedness Theorem ∗
, 2003
"... In this paper, we propose an algorithm to solve the Decisional DiffieHellman problem over finite fields, whose time complexity depends on the effective bound in the Uniform Boundedness Theorem (UBT). We show that curves which are defined over a number field of small degree but have a large torsion ..."
Abstract
 Add to MetaCart
In this paper, we propose an algorithm to solve the Decisional DiffieHellman problem over finite fields, whose time complexity depends on the effective bound in the Uniform Boundedness Theorem (UBT). We show that curves which are defined over a number field of small degree but have a large torsion
Towards the Equivalence of Breaking the DiffieHellman Protocol and Computing Discrete Logarithms
, 1994
"... Let G be an arbitrary cyclic group with generator g and order jGj with known factorization. G could be the subgroup generated by g within a larger group H. Based on an assumption about the existence of smooth numbers in short intervals, we prove that breaking the DiffieHellman protocol for G and ..."
Abstract

Cited by 78 (6 self)
 Add to MetaCart
Let G be an arbitrary cyclic group with generator g and order jGj with known factorization. G could be the subgroup generated by g within a larger group H. Based on an assumption about the existence of smooth numbers in short intervals, we prove that breaking the DiffieHellman protocol for G
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
On the statistical properties of DiffieHellman distributions
, 2002
"... Let p be a large prime such that p−1 has some large prime factors, and let ϑ ∈ Z ∗ p be an rth power residue for all small factors of p − 1. The corresponding DiffieHellman (DH) distribution is (ϑ x, ϑ y, ϑ xy) where x, y are randomly chosen from Z ∗ p. A recently formulated assumption is that giv ..."
Abstract

Cited by 33 (12 self)
 Add to MetaCart
Let p be a large prime such that p−1 has some large prime factors, and let ϑ ∈ Z ∗ p be an rth power residue for all small factors of p − 1. The corresponding DiffieHellman (DH) distribution is (ϑ x, ϑ y, ϑ xy) where x, y are randomly chosen from Z ∗ p. A recently formulated assumption
The Relationship Between Breaking the DiffieHellman Protocol and Computing Discrete Logarithms
, 1998
"... Both uniform and nonuniform results concerning the security of the DiffieHellman keyexchange protocol are proved. First, it is shown that in a cyclic group G of order jGj = Q p e i i , where all the multiple prime factors of jGj are polynomial in log jGj, there exists an algorithm that re ..."
Abstract

Cited by 46 (3 self)
 Add to MetaCart
Both uniform and nonuniform results concerning the security of the DiffieHellman keyexchange protocol are proved. First, it is shown that in a cyclic group G of order jGj = Q p e i i , where all the multiple prime factors of jGj are polynomial in log jGj, there exists an algorithm
Results 1  10
of
1,778