Cryptology ePrint Archive: Report 2007/360
Available versions in chronological order
20070913:200245 (posted 13-Sep-2007 20:02:45 UTC)
Sufficient Conditions for Computational Intractability Regarding Generic Algorithms
Andy Rupp and Gregor Leander and Endre Bangerter and Ahmad-Reza Sadeghi and Alexander W. Dent
20080808:171038 (posted 08-Aug-2008 17:10:38 UTC)
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Andy Rupp and Gregor Leander and Endre Bangerter and Ahmad-Reza Sadeghi and Alexander W. Dent
[
Cryptology ePrint archive
]