Another look at non-standard discrete log and Diffie-Hellman problems

We examine several versions of the one-more-discrete-log and one-more-Diffie-Hellman problems. In attempting to evaluate their intractability, we find conflicting evidence of the relative hardness of the different problems. Much of this evidence comes from natural families of groups associated with...

Full description

Bibliographic Details
Main Authors: Koblitz Neal, Menezes Alfred
Format: Article
Language:English
Published: De Gruyter 2008-12-01
Series:Journal of Mathematical Cryptology
Subjects:
Online Access:https://doi.org/10.1515/JMC.2008.014