Jörg Rothe
- {Go101} O. Goldreich. Foundations of Cryptography. Cambridge University Press, 2001. Google Scholar
Digital Library
- {HO02} L. Hemaspaandra and M. Ogihara. The Complexity Theory Companion. EATCS Texts in Theoretical Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2002.Google Scholar
- {May04} A. May. Computing the RSA secret key is deterministic polynomial time equivalent to factoring. In Advances in Cryptology --- CRYPTO '04, pages 213--219. Springer-Verlag Lecture Notes in Computer Science #3152, 2004.Google Scholar
- {Pap94} C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google Scholar
- {Rot05} J. Rothe. Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2005. Google ScholarDigital Library
- {Sch96} B. Schneier. Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley and Sons, New York, second edition, 1996. Google ScholarDigital Library
- {Sti05} D. Stinson. Cryptography: Theory and Practice. CRC Press, Boca Raton, third edition, 2005. Google ScholarDigital Library
Index Terms
- Review of "Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh", Cambridge University Press, 2006, 292 pages
Recommendations
Stonebraker receives IEEE John von Neumann Medal
In December 2004, Michael Stonebraker was selected to receive the 2005 IEEE John von Neumann Medal for his "contributions to the design, implementation, and commercialization of relational and object-relational database systems." Mike is the first ...
Comments