• Keine Ergebnisse gefunden

Organization of the Exercise and Exam Algorithmic Cryptography

N/A
N/A
Protected

Academic year: 2022

Aktie "Organization of the Exercise and Exam Algorithmic Cryptography"

Copied!
4
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Organization of the Exercise and Exam Algorithmic Cryptography

October 10, 2012

(2)

Tutorials

Tutorial Date Room

1 Mon 14:30 – 16:00 4017 2 Tue 16:30 – 18:00 4017

I Room 4017 is the seminar room of the chair Informatik 1.

I Tutorial registration is possible untilMonday, October 22, 2012, 8:00 am via CampusOffice.

I Announcement of the assignment at Monday afternoon.

I Begin of the tutorials at October 29/30, 2012.

I If you have question regarding the organization and registration, send a mail to

sgeulen@cs.rwth-aachen.de

(3)

Exercise sheets

Release date Hand-in date Discussion Sheet 1 Oct 17 Oct 24 Oct 29/30

Sheet 2 Oct 24 Oct 31 Nov 5/6

Sheet 3 Oct 31 Nov 7 Nov 12/13

Sheet 4 Nov 7 Nov 14 Nov 19/20

Sheet 5 Nov 14 Nov 21 Nov 26/27 Sheet 6 Nov 21 Nov 28 Dec 3/4

Sheet 7 Nov 28 Dec 5 Dec 10/11

Sheet 8 Dec 5 Dec 12 Dec 17/18

Sheet 9 Dec 12 Dec 19 Jan 7/8 Sheet 10 Dec 19 Jan 9 Jan 14/15 Sheet 11 Jan 9 Jan 16 Jan 21/22 Sheet 12 Jan 16 Jan 23 Jan 28/29

I You have to hand in your solution either in the lecture or in the mailbox in front of the chair Informatik 1 until 3 pm on the next Wednesday after release.

I It is strongly recommended to hand in the solution in groups of 2 or 3 students.

(4)

Exam prerequisites

I Each exercise sheet has 4 exercises.

I For a correct and complete solution, you get 4 points.

I You can get 2 additional points if you present your solution in the tutorial on the board.

I If you have at least fifty percent of the points from the exercises (96 points), you are admitted to the exam.

I Please note that you need to register for the exam until Friday, November 23, 2012 via CampusOffice.

Referenzen

ÄHNLICHE DOKUMENTE

One of the talks at the conference aroused Knud Knudson’s interest, an election protocol for yes/no votes where each voter can give a positive or negative vote or he can abstain..

I Please note that you need to register for the exam until Friday, November 22, 2013 via CampusOffice... Presentation of the

As a result of a misapprehension, the vendor sent Knud Knudson a smartphone that can save only one point at the same time.. So Knud Knudson must use the server to do

Definition: Three paths are vertex-disjoint if the intersection of the vertex sets of the paths without the start and end vertex is empty?. Exercise 5.4

I want to present the exercises marked in the following table in the tutorial. Each mark gives two points if you are present in the tutorial and your solution is good (at least

I want to present the exercises marked in the following table in the tutorial. Each mark gives two points if you are present in the tutorial and your solution is good (at least

I want to present the exercises marked in the following table in the tutorial. Each mark gives two points if you are present in the tutorial and your solution is good (at least

Expand the keys to 1024 bits and compare these expanded keys with