Computer Science Department - Technischen Universität München Chair for Efficient Algorithms

Elliptic Curves Cryptosystems (WS 04/05)

• Lecturer:
  Dr. Peter Ullrich

• Area:
  2+2 lectures per week in area III (Theoretical Computer Science)
  advanced course, area algorithms

• Time and Place:
  Lectures: Thu, 15:10 - 16:40, MI 00.04.011
  
  

• Exercises:
  2 hours per week accompanying the lectures
  Time and Place: 12:05 - 13:35, room MI 00.09.022 (start: 03.11.04)
  
  Teaching Assistant:
  

• Audience:
  graduate students of computer science
  students with computer science as minor
  

• Prerequisites:
  1st and 2nd year courses
  Discrete Structures I

• Recommended for:
  

• Contents:
  Introduction -- foundations of cryptography, finite fields and RSA, algebraic curves and divisors (mathematical foundations and algorithms), elliptic curves cryptosystems(ECC), attacks on ECCs, computing the group order (Schoof ...), (hyperelliptic curves)

• Related and Advanced Courses:
  Kryptologie: Kryptographie (A.Gerold) (WS04/05)

• Lecture Notes:
  

• References:
  Ian Blake, Gadiel Seroussi, Nigel Smart: Elliptic Curves in Cryptography; CUP, Cambridge, 1999
  Neal Koblitz: A Course in Number Theory And Cryptography; Springer-Verlag, Berlin, 1994
  Joseph Silverman: The Arithmetic of Elliptic Curves; Springer-Verlag, Berlin, 1986
  Henri Cohen: A Course in Computational Algebraic Number Theory; Springer-Verlag, Berlin, 1993

• Office Hours:
  look here

• Supplements:
  LiDIA, A C++ Library For Computational Number Theory: LiDIA homepage , LiDIA manual