<< 2011-2 >>
Department of
Computer Science
 

Lecture Notes

Lecture No. of Slides Notes Outline of Contents
1,2,3,4 10 Notes
Models in Cryptography
  • Models in Cryptography
  • IND-CPA,IND-CCA Models for Encryption
  • Attacks in Models
5,6,7,8,9 70 PDF
3x3
Signature Schemes
  • Digital Signatures RSA and DSA
  • Hash Functions
  • Other Schemes : Schnorr, Nyberg-Rueppel
10,11,12,13,14,15,16 97 PDF
3x3
Zero-Knowledge Proofs and Provable Security
  • e-Cash
  • Commitment and Zero-Knowledge Proofs
  • Signature Scheme Security Proofs
  • Other ZK Proofs
17,18,19,20 We will cover material from these slides in the lectures, and said material will be examinable. As I stressed in the lectures, the high-level concepts are more important than the low-level details; for example, you won't ever be asked to recall the (lengthy) formula for point arithmetic from memory. Even if we get time to cover material from these slides in the lectures, said material won't be examinable. Elliptic Curve Cryptography (ECC)
  • Elliptic curves and point arithmetic.
  • Efficient scalar multiplication.
  • Standards, schemes and patent issues.
  • Attacks on the ECDLP (time permitting).
© 1995-2012 University of Bristol  |  Terms and Conditions
About this Page