Cryptography WS 2011/2012

Slides

• Final version (02.02.2012, 13:30): [Slides] [Slides as script]
  
  Further changes/fixes will be published here on the webpage.
  
  User: crypto11, Password pw to access the slides is constructed by:
  • pw = x || y where
  • x^{17} mod 7571 = 369, and
  • k * y mod 4547 = 4486 where k is the secret key generated by Alice and Bob using the Diffie-Hellman protocol w.r.t.
    • the group of quadratic residues generatd by 9 modulo the safe prime 4547,
    • Bob's secret b=23, and
    • Alice's public information hA=1607.
  • As usual, || denotes the concatenation of the two numbers.
  • Use e.g. Wolfram alpha, it can handle all the required operations easily.
  
  
  
  
  

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
    • Modern Cryptography, Probabilistic Proofs and Pseudorandomness (draft)
    • Foundations of Cryptography (drafts)
  • 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
    • Free online version
  • 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
    • Webpage
    • Proofs of security