CSCE 557
Introduction to Cryptography
|
Duncan A. Buell
Interim Dean
College of Engineering and Information Technology
University of South Carolina Columbia, SC 29208
|
3A01 Swearingen Engineering Center
buell
in domain
cse.sc.edu
803-777-7356(voice)
803-777-9597(fax)
Office hours: 8:30-9:30pm T-Th (tentative)
|
|
|
|
CSCE 557 web page
|
|
|
Class meeting time: TTh 9:30-10:45, SWR 2A19
Office hours: TTh 8:30-9:30, SWR 3A01 (tentative)
|
|
Caveat
This page is likely to be under changing throughout the
semester as assignments and notes are added to it.
|
|
Text
Wade Trappe and Lawrence C. Washington,
Introduction to Cryptography with Coding Theory,
2d ed., Prentice Hall, 2005.
|
Other References
-
Thomas H. Barr,
Introduction to Cryptology,
Prentice hall.
-
Johannes Buchmann,
Introduction to Cryptography,
Springer Verlag.
-
Cipher A. Deavours, David Kahn, Louis Kruh, Greg Mellen, Brian Winkel,
Cryptology: Yesterday, Today, and Tomorrow,
Artech House.
-
Paul Garrett,
Making and Breaking Codes: An Introduction to Cryptology,
Prentice Hall.
-
Darrel Hankerson, Alfred Menezes, and Scott Vanstone,
Guide to Elliptic Curve Cryptography,
Springer Verlag.
-
Wenbo Mao,
Modern Cryptography,
HP/Prentice Hall.
-
Wayne Patterson,
Mathematical Cryptology,
Rowman and Littlefield.
-
Bruce Schneier,
Applied Cryptography,
Wiley.
-
Douglas R. Stinson,
Cryptography: Theory and Practice,
Chapman and Hall/CRC.
-
Michael Welschenback,
Cryptography in C and C++,
Apress.
-
William Stallings,
Cryptography and Network Security,
Prentice Hall.
Other readable books that might not be called "references"
-
James Bamford,
The Puzzle Palace,
Penguin Books, 1983.
-
James Bamford,
Body of Secrets,
Anchor Books, 2002.
-
Matt Curtin,
Brute Force: Cracking the Data Encryption Standard,
Copernicus Books, 2005.
-
Edward J. Drea,
MacArthur's Ultra: Codebreaking and the war against Japan, 1942-1945,
University Press of Kansas, 1992.
-
Ted Enever,
Britain's Best Kept Secret,
Sutton Publishing, 1994.
-
Helen F. Gaines,
Cryptanalysis,
Dover, 1956.
-
David Kahn,
The Codebreakers,
Simon and Schuster, 1996.
-
Rudolf Kippenhahn,
Code Breaking: A history and exploration,
Overlook Press, 1999.
-
Ronald Lewin,
The American Magic,
Penguin Books, 1983.
-
Fletcher Pratt,
Secret and Urgent,
Blue Ribbon Books, 1942.
-
Gordon Welchman,
The Hut 6 Story.
-
Herbert O. Yardley,
The American Black Chamber
Bluejacket Books.
Web Page Links
|
|
Email
There are CSE department email aliases for CSCE 557, namely
csce557-001
and
csce557-002
in the domain
cse.sc.edu.
This alias sends email to the CSE departmental login
userid@cse.sc.edu
that you get with this course.
A mass mailing to the entire class will be done through these mail aliases.
Actually, any of you can send mail to this alias.
The mail alias of the previous paragraph sends mail to the
CSE departmental login that you get with this course.
You are responsible for reading mail sent to this account.
You can set the dot forward file (via the secure web server service
for this purpose) to any other account you wish, whether it be an
engr.sc.edu,
gwm.sc.edu,
yahoo.com,
or similar account, but you are responsible for reading
the mail that gets sent to your
cse.sc.edu account.
If you send me an email from some other account, then I will respond
to that email with the "Reply" button.
However, if I have to initiate an email to you,
I will not use any account other than the CSE departmental account.
This includes the
engr.sc.edu
or any other USC accounts.
To repeat:
I will initiate mail to you individually only at
userid@cse.sc.edu.
I will not initiate email to you directed to any other account you may have.
|
|
Outline, Prerequisites, and Expectations:
Prerequisites are CSCE 145 and MATH 141 and either CSCE 355 or MATH 574.
The text has code for the algorithms in Maple, Matlab, and Mathematica.
As time permits, there will be programming to this course as well as
theoretical and mathematical analysis of the cryptographic algorithms.
This course could be taught so as to leave behind all but the most
prepared of mathematics students, or to leave behind all but the
best programmers.
I hope to do neither by striking a middle ground between theory and
practice.
|
|
Tests and assignments
There will be one midterm exam and a final exam during the semester.
The midterm is presently scheduled for 27 Sep 2005, timed so
that you can get back your exams on 29 Sep 2005, the last day
to drop without receiving a WF grade.
The final exam is scheduled for Thursday, 8 Dec 2005, at 9:00 am.
I do not assign "homework" any more.
In lieu of homework, there will be pop quizzes in class.
This is the link to the
programming assignments.
|
|
Grading scheme
The final grade will be computed on the basis of the weighted average
of the scores for
-
quizzes and participation (10%),
-
the midterm exam (30%),
-
the programming assignments (30%),
-
the final exam (30%).
The final grades will almost certainly be curved,
but you should expect no lower a grade
than you would receive under the usual 90/80/70/60/50 scheme.
In keeping with university regulations, graduate students will also
have to complete a major project.
For the graduate students, this will affect the point totals of the
30% that is the programming assignment part of the point total.
This project is due to me by noon Wednesday 7 December 2005.
|
|
Sample files
there are some
sample files
available.
|
|
Lecture notes, slides, and pointers
(Caveat: Any lecture notes I prepare may well change during the
lecture process; if you print them too early and too often you may
use up your print quota.)
-
Some
names
in cryptography to know
-
Lecture notes 1
pdf
-
Lecture notes 2
pdf
-
The Yardley cipher
pdf
-
Some notes on arithmetic
pdf
-
Lecture notes 3
pdf
-
Lecture notes 4
pdf
-
Lecture notes on Montgomery arithmetic
postscript
pdf
-
Lecture notes 5
pdf
-
Lecture notes 6
pdf
-
Lecture notes 7
pdf
-
Some notes on elliptic curves
ps
pdf
|
|
Deadlines
Assignments will have due dates.
Unless otherwise specified, these will be turned
in by the beginning of the class period on the due date.
Late assignments will not be accepted without prior arrangement
to accommodate truly extraordinary circumstances.
|
|
Academic Honesty
Assignments and examination work are expected to be the sole effort
of the student submitting the work.
Students are expected to follow the
Code of Student Academic Responsibility
found in the
Carolina Community
and should expect that every instance of a suspected violation
will be reported.
Students found guilty of violations of the Code will be subject to academic
penalities under the Code in addition to whatever disciplinary sanctions
are applied.
There seems to be a widespread misunderstanding of the concept
of "your own work."
In addition to the USC Code, some good sources of text for what is or
is not acceptable behavior are the
academic honesty policy statement from Harvey Mudd College, the
policy statement from Professor Steven Huss-Lederman at Beloit College,
and the text of part of the
collaboration policy statement from MIT.
You can expect your programming assignments to be checked against
those turned in by other members of the class as well as code that I can
find on the web.
I expect the correlations between your work and that of others to be minimal.
A sample first-offense admission can be found at
admission.
|
|
Proper Use of Computing Resources
Students are expected to be aware of the
university policy
on use of computing resources, including the
Student Guidelines for Responsible Computing,
as well as the
college
and
departmental
policies on proper use of computing resources.
Every instance of a suspected violation will be reported.
Students should be aware that neither the instructor nor the
department are responsible for making alternative arrangements
should improper use leading to revocation of access to departmental
or college resources make it impossible for you to complete the
programming assignments on time.
|
|
On the nature of academic work
Students might also find relevant an
essay
from a professor at Georgia Tech.
|
|
|
|
|