Algorithmic
Number Theory - SS 2004
Final
exam:
Friday, 23.7.
You can get your certificate for this lecture from Ellen Fries, room 402.
You can get your certificate for this lecture from Ellen Fries, room 402.
 |
Lecture: Tuesday, 11.15 - 12.45 |
| |
Discussion Section: Friday 11.15 - 12:45 |
| |
Location: Lecture Room 024, Building 46 MPI |
| Course Language: English |
|
| Credit Points: 6 |
Topics:
Euclidean Algorithm and Continued
Fractions
Lattices and the LLL Algorithm,
Factoring Rational Polynomials
Primes, Primality Tests and Factorization
Public
Key Cryptography
The Subset Sum
Problem and Breaking Knapsack Cryptosystems
Discrete Logarithm
Literature:
Von zur Gathen, Gerhard: Modern Computer Algebra
Shoup: A Computational Introduction to Number
Theory and Algebra
Buchmann: Introduction
to Cryptography
Grading:
| |
20% exercises, 40% midterm,
40% final |
| |
50% of exercise points until
midterm date are required for admittance to midterm |
| |
50% of total exercise
points and successful participation in midterm are required for final |