|Volker Sorge||10 credits in Semester 1|
The full glossary for the Cryptography lecture notes is available.
Field Trip to Bletchley Park, Wednesday 9th January 2008: We will leave at 10 am sharp(!) from the roundabout between University station and building B1 on the blue zone of the campus map. We should be back before 6pm.
For Programming Exercise 2 I have again put together a stepwise walkthrough of the algorithm using the first message to be hashed as an example. Please have a look at the PDF or PS file.To help with debugging for Programming Exercise 1 I have put together a stepwise walkthrough of the algorithm, including all intermediate results, for the first message/key pair. Please have a look here.
There has been an addition to Handout 5 regarding security and legal issues of CSS.
The Exercise 1 marks have been entered. Please have a look here. Please check the marks and in case you have not got a mark or you have a 0 mark but believe this is incorrect, please come and see me after the next lecture!
An addendum has for handout 2 has been added with additional explanations and examples for DES. Please have a look here.
Several mistakes on the solutions for exercise sheet 1 have been found. Please see the Errata for corrections.
The lecture theatre for Friday lecture and exercise classes
have been fixed:
Lecture: Fridays 2:00-3:00 in G34, Mechanical Engineering (Building Y3 on the Campus Map)
Exercises: Fridays 3:00-4:00 in 301, Biosciences (Building R27 on the Campus Map)
Fridays 3:00-4:00 in 301, Biosciences (Building R27 on the Campus Map)
Exercises will be held by Dr Guilin Wang.
80% of your course mark will be determined by a 1.5-hour examination in May (or early June).
20% of the mark is determined by continuous assessment. See Handout 0 for details.
For continuous assessment exercises marked so far please see here
If you have any questions, problems, or comments, please email me or come and see me during my office hours Tuesdays 2.30-3.30pm. To see me outside these office hours, please email me and suggest some times, which are compatible with my timetable.
When emailing, please observe that you can expect the fastest response, when your email is short and in plain ASCII. If you have to send attachments, please make sure they are in some open standard format. In particular, do NOT send MS word files. Why? See here.
|Practical Cryptography||Fergueson, Schneier||John Wiley & Sons||Supplementary Reading|
|Applied Cryptography||Schneier||John Wiley & Sons||Supplementary Reading|
|Handbook of Applied Cryptography||Menezes, van Oorschot, Vanstone||CRC Press||Supplementary Reading|
|Cryptography||Smart||McGraw Hill||Supplementary Reading|
|Beginning Cryptography with Java||Hook||John Wiley & Sons||Book on Programming|
|Contemporary Cryptology||Catalano, Cramer, Damgard, DiCrescenzo, Pointcheval, Takagi||Springer Verlag||Advanced Material|
|0||General Information||gzipped PostScript, pdf|
|1||Historical Ciphers||gzipped PostScript, pdf||gzipped PostScript, pdf|
|2||Block Ciphers: Feistel Ciphers, DES||gzipped PostScript, pdf||gzipped PostScript, pdf|
|3||Modes of Operations, Cryptomeria||gzipped PostScript, pdf||gzipped PostScript, pdf|
|4||AES (Rijndael), Finite Fields||gzipped PostScript, pdf||gzipped PostScript, pdf|
|5||Stream Ciphers: RC4, LFSR, CSS, A5/1||gzipped PostScript, pdf||gzipped PostScript, pdf|
|6||Key Exchange Protocols
Overview of Cryptanalysis techniques
|gzipped PostScript, pdf|
|7||Cryptographic Hash Functions
Message Authetication Codes
|gzipped PostScript, pdf||gzipped PostScript, pdf|
|8||Public Key Cryptography, Discrete Logarithms||gzipped PostScript, pdf||gzipped PostScript, pdf|
|9||RSA, Generating Prime Numbers, Arithmetic Modulo Composites||gzipped PostScript,
||gzipped PostScript, pdf|
Guest Lecture by Iain Styles
Guest Lecture by Guilin Wang
|gzipped PostScript, pdf Slides--->|
|11||Certificates, Commitment Schemes, Zero Knowledge Proofs||gzipped PostScript, pdf--->|
|12||Review Suggestions||gzipped PostScript, pdf|
|Glossary||The complete Cryptography glossary||gzipped PostScript, pdf|
Errata can be found here.
Implement the exercises in a programming language of your choice.
The only requirement is that the program should be runnable on the Linux machines in the department.
Include sufficient explicit output into your program so I can convince myself that the computation actually
Submit the source of your program (with an included comment how to run it) via Moodle.
Also submit a paper with the requested answers (i.e. only the answers to the problems, not the full intermediate output!) via the pigeonholes.
|1||Miniature Rijndael||In Handout 4 (ps.gz, pdf)||Solutions (ps.gz, pdf)||Marking Scheme||2||MD-like Hash Function||In Handout 7 (ps.gz, pdf)||Solutions (ps.gz, pdf)||Marking Scheme|
School of Computer Science,
The University of Birmingham
Last modified: Wed Apr 30 18:24:28 BST 2008