Efficient cryptography (2+1)

Responsible:

Prof. Dr. Joachim von zur Gathen

Lecturer:

Jamshid Shokrollahi

Scedule:

• Tu 11:20 - 12:50, Rheinsaal
• Tu 13:00 - 14:00, computer pools U37 and U38

Prerequisite:

C or C++ programming

Summary:

In this lecture efficient implementations of cryptographic systems will be discussed. Although the topics of the course focus on the cryptography from an algorithmic point of view, several sessions are devoted to practical implementations on personal computers (PCs). The following materials will be discussed:

• An overview of Visual Studio .NET environment
• Long integer arithmetic and its applications in RSA cryptosystem
• Finite field arithmetic and its applications in elliptic curve cryptography
• The study of some known attacks on specific implementations of cryptographic systems
• Using Visual Sudio .NET profiler
• Hardware-related tips and tricks to improve the efficiency for Pentium platforms
• Software project

Literature:

• Bruce Schneier, Applied Cryptography
• Douglas Stinson,Cryptography
• Darrel Hankerson and Alfred Menezes and Scott Vanstone, Guide to Elliptic curve cryptography