Advanced cryptography course

[Robert Hettinga]

--- begin forwarded text


Date: Sat, 28 Dec 1996 12:24:41 -0500 (EST)
From: Christof Paar <christof at ece.WPI.EDU>
To: DCSB <dcsb at ai.mit.edu>
Subject: Advanced cryptography course
MIME-Version: 1.0
Sender: bounce-dcsb at ai.mit.edu
Precedence: bulk
Reply-To: Christof Paar <christof at ece.WPI.EDU>

This is an announcment for an advanced cryptography course in the greater
Boston area:

Here comes the syllabus for the course EE 589R, Advanced Topics in
Cryptography and Data Security. The first class will be held on Monday,
January 20, at Worcester Polytechnic Institute.

The course is a continuation of EE 578/CS 578, Cryptography and Data
Security. It will provide a deeper insight into several areas of cryptology
which are of great practical and theoretical importance. The three main
areas treated are: Detailed analysis and implementation of public key
algorithms, advanced protocols, and modern attacks against cryptographic
schemes. We will address many topics which are usually only treated in the
research literature.

Please feel free to get in touch with me any time if you have further
questions about the course.

Regards,

Christof Paar

****************************************************************************
Christof Paar                      http://ee.wpi.edu/People/faculty/cxp.html
Assistant Professor                email:  christof at ece.wpi.edu
ECE Department                     phone:  (508) 831 5061
Worcester Polytechnic Institute    fax:    (508) 831 5491
100 Institute Road
Worcester, MA 01609, USA
***************************************************************************




EE 579R, ADVANCED TOPICS IN CRYPTOGRAPHY AND DATA SECURITY

                       Spring `97
                  WPI, Monday 5:30-8:30


                       SYLLABUS

Week 1
Efficient implementation of RSA: The Chinese Remainder Theorem.

Week 2
Efficient implementation of public-key systems over finite fields: Galois
fields theory.

Week 3
Implementation of Galois field arithmetic.

Week 4
Efficient arithmetic with long numbers: Montgomery and Karatsuba-Ofman
algorithm.

Week 5
Efficient exponentiation algorithms.

Week 6
Attacks against the discrete logarithms: Shank's algorithm and Pollard's-rho
method.

Week 7
Midterm Exam

Week 8
Attacks against the discrete logarithms: Index calculus method.

Week 9
Attacks against block ciphers: Differential cryptanalysis.

Week 10
Block ciphers from arithmetic operations: IDEA.

Week 11
Secret sharing and threshold schemes.

Week 12
Zero knowledge identification schemes.

Week 13
Selected topics, depending on class interest.

Week 14
Final Exam.


TEXTBOOK

Menezes, van Oorschot, Vanstone: Handbook of Applied Cryptography. CRC
Press, October 96, ISBN 0-8493-8523-7, $80







~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
To unsubscribe from this list, send a letter to: Majordomo at ai.mit.edu
In the body of the message, write:  unsubscribe dcsb
Or, to subscribe,           write:  subscribe dcsb
If you have questions, write to me at Owner-DCSB at ai.mit.edu

--- end forwarded text



-----------------
Robert Hettinga (rah at shipwright.com), Philodox,
e$, 44 Farquhar Street, Boston, MA 02131 USA
"The cost of anything is the foregone alternative" -- Walter Johnson
The e$ Home Page: http://www.vmeng.com/rah/