Slides
- Current version (09.02.2011, 14:56): [PDF][4-on-1-PDF]
- Errata:
- Slide 145: in the formula, replace one occurrence of U_{l(n)} by G(U_n).
- Slide 240: replace ``not CPA-secure'' by ``not CCA-secure''.
- Slide 241: the message should only consist of the last n bits, i.e., m_0 = 0^n, m_1= 1^n
- Slide 377: in the formula replace ``hc_I'' by ``hc_J''. Alice and Eve only have access to the public function paramters J.
- Annotated slides:
Disclaimer: Provided "as is" with no claim of correctness.
References, Further Reading, Tools
- General cryptography:
- Lecture notes by Mihir Bellare
- Introduction to modern cryptography, J. Katz, Y. Lindell, Chapman & Hall/CRC, 2007
- A Computational Introduction to Number Theory and Algebra by Victor Shoup
- Oded Goldreich's homepage
- CRYPTUTOR
- Kryptologie, Ch. Karpfinger, H. Kiechle, Vieweg+Teubner 2010
- Einführung in die Kryptographie, Johannes Buchmann, Springer Verlag, 2010
- Handbook of applied cryptography, A. Menezes, P. van Oorschot, S. Vanstone, CRC, 2001
- Cryptool
- Specific topics:
- Computational Complexity, S. Arora, B. Barak, Cambridge University Press, 2009
- Computational Complexity, C. Papadimitriou, Addison Wesley, 1995
- Elliptic Cruves - Number Theory and Cryptography (2n edition), L. Washington, Chapman & Hall/CRC, 2008
- Elliptic Curve Public Key Cryptosystems, A. Menezes, Kluwer Academic Publishers, 1993)
- Elliptische Kurven in der Kryptographie, A. Werner, Springer, 2002
- Example: Skein
|
Contact
Teaching
