Cryptography
Corresponding entry in Aachen Campus, Bonn Basis.
Lecture
Tutorial
Time & Place
Extra Turorial (optinal) on Thursday 9.2. at 1300, b-it Rheinsaal.
- Monday, 1300-1430, b-it bitmax
- Thursday, 1300-1430, b-it bitmax
- Tutorial 1: Monday, 1000-1130, b-it room 2.1
- Tutorial 2: Monday, 1445-1615, b-it Rheinsaal
First meeting: Monday, 31 October 2011
Important advice
Master students in Computer Science at University of Bonn have to register this course with POS (aka BASIS).
Announcement
We meet for an end-semester drink on thursday 2.2. at 1900 in "Em Hoetchen". Please send us an email if you are palning to come, so that we can reservate a table.
You have the opportunity to grade us! To do so visit https://www.umfragen.uni-bonn.de/lehre (unforunately only in German) between 03.02.2012 and 17.02.2012 and log in with Veranstaltungskennung "MA-INF1103" and Passwort XXX (<- can be viewed if you log in).
Allocation
4+2 SWS, 8 credits. Optionally, 3+2 SWS, 6 credits.
- Media Informatics: Computer and Communication Technology.
- Recommendation for University of Bonn - Computer Science: A or A1, respectively.
The lecture's mailing list
Students are encouraged to ask and answer any questions related to the course on the mailinglist:
You can subscribe to and unsubscribe from to the mailing list using the information given on the list's Info page.
Final Exam
1st exam: 15 February 2012, 13.00 - 15.00 in b-it bitmax.
2nd exam: 26 March 2012, 13.00 - 15.00 in b-it bitmax.
Exam hints
Verify whether your exam exercise sheets are complete: It should contain Exercise 1 to Exercise ??. Insert your name and matrikel (student number) on each sheet. Approaches, solutions and all side calculations must be written to the given paper. Please use also the back sides. If you need extra paper ask the supervisor. Do not remove the staple!Do not use a pencil or any other erasable pen.
The exam must be handled independently. Permitted auxiliary means are: writing materials, a pocket calculator (non-programmable, without division with remainder, without linear algebra software), and a sheet with your own notes (a two-sided DIN A4 sheet with only your own handwriting, no photocopy). Any other utilities, even own paper, are not permitted.
The exam will carry the hints displayed on the right.
Exercises
- Exercise 1 (PDF, last updated 03 November 2011, 16:04).
- Exercise 2 (PDF, last updated 14 November 2011, 18:13).
- Exercise 3 (PDF, last updated 17 November 2011, 19:18).
- Exercise 4 (PDF, last updated 24 November 2011, 18:04).
- Exercise 5 (PDF, last updated 01 December 2011, 19:01).
- Exercise 6 (PDF, last updated 09 December 2011, 00:24).
- Exercise 7 (PDF, last updated 15 December 2011, 22:07).
- Exercise 8 (PDF, last updated 22 December 2011, 17:23).
- Exercise 9 (PDF, last updated 12 January 2012, 18:57).
- Exercise 10 (PDF, last updated 20 January 2012, 08:29).
- Exercise 11 (PDF, last updated 27 January 2012, 10:33).
Submission guidelines
Students may discuss the exercises in groups but must submit the assignments individual. The assignments should be handwritten and handed in Thursdays before the lecture.
Contents
Cryptography deals with methods for secure data transfer. In earlier times this was the domain of military and intelligence agencies, but today modern cryptography has grown into a key technology, enabling e-commerce and secure internet communications. Its many applications range from credit and debit cards, mobile phones, tv decoders, and electronic money to unforgeable electronic signatures under orders and contracts in the internet. In the course, we first discuss two of the current standard tools, namely AES and RSA. Further topics are key exchange, including group cryptography and discrete logarithm, digital signatures and identification, and cryptographic hash functions.
Links, slides, etc.
- A visualisation of AES flows (needs Java). Each "wire" carries one byte encoded as a color.
- Hash function slides
- Signature schemes
- GHR slides
- Security and reductions
- Elliptic curve