[crypto] [eidma@TUE.nl: 5-day EIDMA minicourse on Computational Methods in PKC]

[R. Hirschfeld]

------- Start of forwarded message -------
Subject: 5-day EIDMA minicourse on Computational Methods in PKC
Date: Tue, 10 May 2005 10:22:18 +0200
From: "Secretariaat EIDMA" <eidma@TUE.nl>

5-day EIDMA minicourse on

Computational Methods in Public Key Cryptography

http://www.win.tue.nl/math/eidma/courses/minicourses/lenstralange/lenstralange.html

 

 

lecturers:

 

Prof. Arjen K. Lenstra

Lucent Technologies, USA  and

TU Eindhoven, The Netherlands.

 

Dr. Tanja Lange

TU Denmark, Copenhagen, and

Ruhr Universität Bochum, Germany

 

Arjen K. Lenstra is Distinguished Member of Technical Staff at Bell Laboratories, Lucent Technologies. Before joining Bell Labs in 2004 he was Vice President at Citibank's Information Security Office, Citibank, New York, Senior Scientist at Bellcore, Visiting Professor at The University of Chicago and he held visiting positions at IBM Thomas J. Watson Research Center, AT&T Bell Labs, and DEC Systems Research Center. Furthermore, since May 2000, he is professor of cryptology at the Eindhoven University of Technology, The Netherlands. His main research interest is cryptanalysis of public key cryptosystems, in particular the RSA cryptosystem. Lenstra wrote the software that was used to break the famous 1977 Scientific American RSA challenge, and he was involved in the first successful attack on a 512-bit RSA modulus in 1999. He is co-inventor of the public key cryptosystem XTR. He received his PhD from the University of Amsterdam, The Netherlands. 

Tanja Lange is Associate Professor at the Technical University of Denmark (DTU), located in Copenhagen. Her research interests are in the area of public key cryptography, mainly in elliptic and hyperelliptic curve cryptography. Before joining DTU she was with the Ruhr-University Bochum in the research group of Dobbertin and the University of Duisburg-Essen, where she did her PhD under the supervision of Frey. 


Contents 
This course consists of a detailed presentation of the most important computational methods that are used in public key cryptography and cryptanalysis. Topics that will be discussed include basic arithmetic (including Montgomery multiplication), Euclidean algorithms, a wide variety of exponentiation methods, finite field arithmetic, probabilistic and provable prime generation methods, (hyper-)elliptic curves and their properties and arithmetic integer factorization methods (such as Pollard's p-1 and rho methods, the elliptic curve method, linear and quadratic sieve, and the number field sieve), methods to calculate discrete logarithms, and the Weil and Tate pairings, including their computation and their cryptographic and cryptanalytic implications. 

Time and Place 
Technische Universiteit Eindhoven, The Netherlands, 
June 13 - 17, 2005. 

Admission fee 
The admission fee for this minicourse is EURO 700. However, our courses are free of charge for EIDMA members and for university students in general. Reductions or exemptions do apply to members of other academic insitiutes. For the exact conditions please see our minicourse registration form: http://www.win.tue.nl/math/eidma/REGISTRATIEFORMULIER.html

Registration 
You can register by sending a completed registration form (http://www.win.tue.nl/math/eidma/REGISTRATIEFORMULIER.html) to ms.  Henny Houben at eidma@tue.nl Deadline for registration is May 29, 2005. 
Please note that your registration is only official after our written confirmation of its receipt. 

 
E I D M A
Euler Institute for Discrete Mathematics and its Applications
Technische Universiteit Eindhoven
P.O. Box 513
5600 MB  Eindhoven
The Netherlands
telephone: +31 (0)40 247 3121
telefax: +31 (0)40 243 5810
e-mail: eidma@tue.nl
WWW-page: www.win.tue.nl/math/eidma
------- End of forwarded message -------