- Lower bounds for discrete logarithms and related problems (Victor Shoup, Eurocrypt 1997)
- Lower Bounds on Generic Algorithms in Groups (Ueli Maurer, Stefan Wolf)
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model (Alexander Dent)
- A Machine-Checked Formalization of the Generic Model and the Random Oracle Model (Barthe, Cederquist, Tarento, Automated Reasoning 2004)
- The Hardness of The DHK Problem in The Generic Group Model (Alexander Dent, 2006)
- Abstract models of computation in cryptography (Ueli Maurer, WCC 2005)
![[citeseer]](http://citeseer.ist.psu.edu/icon/cssmall.gif){kind=icon}
Cryptology Pointers by Helger Lipmaa
Got any suggestions or additional links? Mail to <lipmaa>
research.cyber.eeNB! If you find any broken links, please be kind and report them to me together with their current location!
(C) Helger Lipmaa 1997-2009.