Statistical Approach to the Decision Diffie-Hellman Problem
Ionut Florescu
Stevens Institute of Technology
Monday, October 2, 3:00PM
Lieb, Room 319
Stevens Institute of Technology
Abstract
In this talk we present a novel approach to the Decision
Diffie-Hellman cryptography problem. The security of many
cryptographic schemes rely on the hardness of this problem. We are
giving a purely statistical criterion to compare this problem in
different groups. We are using Z_p with p prime as a prime example
but the methods presented are not restricted to these groups. We find
empirical evidence that relates the hardness of the DDH problem to the
number of prime factors of p-1 and with the size of the biggest prime
factor of p-1.