Friday, July 25, 2008 3:30 pm
-
4:30 pm
EDT (GMT -04:00)
One-More Discrete Logarithm Problems
Speaker: | Alfred Menezes |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics & Computer Building (MC) 5158 |
Abstract:
There are many issues that arise in interpreting reductionist proofs of security of cryptographic protocols. I will consider the case of security proofs that rely on the hardness of non-standard one-more discrete logarithm and Diffie-Hellman problems.
This is joint work with Neal Koblitz.