Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:11:01
Robert Hettinga (rah@shipwright.com)
Mon, 24 Aug 1998 11:54:10 -0400
--- begin forwarded text
Date: Sun, 23 Aug 1998 13:18:11 -0400 (EDT)
From: Christof Paar <christof@ece.WPI.EDU>
To: ecegraduate@ece.WPI.EDU
cc: John Orr <orr@ece.WPI.EDU>
Subject: WPI Cryptography Courses
MIME-Version: 1.0
Sender: bounce-dcsb@ai.mit.edu
Precedence: bulk
Reply-To: Christof Paar <christof@ece.WPI.EDU>
This in announcement for my crypto graduate course this fall. Please note
that in the spring we will offer EE579R, Selected Topics in Cryptography,
as a follow-up course.
Also in the Spring semester, WPI's Mathematics Dept. will offer MA533,
Discrete Mathematics II, with a course contents tailored for students
interested in the mathematics of cryptography. All of these graduate
course will be taught in the evening.
For registration, please contact goa@wpi.edu or register on-line through
WPI's web site.
Regards,
Christof Paar
*************************************************************************
Christof Paar http://ee.wpi.edu/People/faculty/cxp.html
Assistant Professor email: christof@ece.wpi.edu
Cryptography Group phone: (508) 831 5061
ECE Department, WPI fax: (508) 831 5491
100 Institute Road
Worcester, MA 01609, USA
*************************************************************************
****************************************************************************
WPI
EE 578/CS 578: CRYPTOGRAPHY AND DATA SECURITY
Fall '98, Wednesday, 5:30-8:30 pm, AK 219
First day of class: Sept. 9
COURSE DESCRIPTION
This course gives a comprehensive introduction into the field of
cryptography and data security. We begin with the introduction of the
concepts of data security. Different attacks on cryptographic systems are
classified. Some pseudo-random generators are introduced. The concepts of
public and private key cryptography is developed. As important
representatives for secret key schemes, DES and other private key algorithms
are described. Modes of operation and exhaustive key search attacks are
discussed. The public key schemes RSA, ElGamal, and elliptic curve crypto
systems are developed. As important tools for authentication and integrity,
digital signatures and hash functions are introduced. Advanced protocols for
key distribution in networks are developed. Identification schemes are
treated as advanced topics. Some mathematical algorithms for attacking
cryptographic schemes are discussed. Special consideration will be given to
schemes which are relevant for network environments. For all schemes,
implementation aspects and up-to-date security estimations will be
discussed.
PREREQUISITES
Working knowledge of ``C''. An interest in discrete mathematics and
algorithms is highly desirable.
TEXTBOOK
D.R. Stinson, Cryptography: Theory and Practice. CRC Press, 1995
(mandatory)
B. Schneier, Applied Cryptography. 2nd edition, Wiley & Sons, 1996
(recommended for additional reading)
SYLLABUS EE 578/CS 578
An important part of the course is an independent project. The project topic
can freely be chosen by the student. Possible topics include (but are not
limited to) implementation of a real-size cryptographic algorithm or
protocol, a literature study on new cryptographic schemes or on legal
aspects of cryptography, or implementation of an algorithm for attacking a
cryptographic scheme.
WEEK 1:
Introduction: Principals of cryptography. Classical algorithms.
Attacks on cryptographic systems.
WEEK 2:
Stream ciphers and pseudo-random generators. Some information theoretical
results on cryptography.
WEEK 3:
Private key cryptography: The Data Encryption Standard DES. Brief history,
function and performance.
WEEK 4:
Private key cryptography: Recent results on successful attacks on DES.
Operation modes of symmetric ciphers. IDEA and other alternatives to
DES.
WEEK 5:
Public key cryptography: Introduction. Some Number Theory and Algebra.
WEEK 6:
Public key cryptography: RSA. Function and security. Recent results on
successful attacks on RSA.
WEEK 7:
Midterm exam.
WEEK 8:
Public key cryptography: The discrete logarithm problem. Diffie-Hellman key
exchange. ElGamal crypto system. Function and security estimations.
WEEK 9:
Public key cryptography: Elliptic curve systems. Mathematical background,
function and security.
WEEK 10:
Digital Signatures: RSA signature scheme. Message Authentication Codes
(MAC).
WEEK 11:
Hash functions: Functionality and attacks. Protocols: Attacks against
protocols, protocols for privacy, authentication, and integrity.
WEEK 12:
Key distribution in networks: Private key approaches, certificates, and
authenticated key agreement.
WEEK 13:
Identification schemes: Challenge-and-response protocols. Protocols for
smart cards.
WEEK 14:
Final exam.
*************************************************************************
Christof Paar http://ee.wpi.edu/People/faculty/cxp.html
Assistant Professor email: christof@ece.wpi.edu
Cryptography Group phone: (508) 831 5061
ECE Department, WPI fax: (508) 831 5491
100 Institute Road
Worcester, MA 01609, USA
*************************************************************************
For help on using this list (especially unsubscribing), send a message to
"dcsb-request@ai.mit.edu" with one line of text: "help".
--- end forwarded text
-----------------
Robert A. Hettinga <mailto: rah@philodox.com>
Philodox Financial Technology Evangelism <http://www.philodox.com/>
44 Farquhar Street, Boston, MA 02131 USA
"... however it may deserve respect for its usefulness and antiquity,
[predicting the end of the world] has not been found agreeable to
experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:11:01