|
PROJECT
DETAILS :
RESEARCH
PROJECTS
Students
are required to produce two projects on an applied aspect of cryptography or
network security, building upon and complementing the material covered in the
class. You will be working with other class members as part of a team.
A
set of suggested projects is included below. You may select one of the suggested
projects or you may devise your own comparable project. All projects must be
approved by the instructor. Each topic will be allocated to only one group.
i.e. More than one group cannot work on the same topic.
PROCEDURE
for ALLOCATION of the PROJECT:
Every
group may scan through the list and try to decide about the topic, it would like
to have. On Tuesday, 29 Jan 2002, at 2.30 in Room No. 2139, the topic allocation
will be finalized. If there is more than one group, which is opting for the same
topic, the allocation will be decided by a draw at that time.
By
2nd Feb 2002, every team must submit, by e-mail, a well-organized
proposal of one to three pages in length. The proposal should clearly describe
the project to be undertaken, including the topic to be covered, any
investigation, development, or experimentation to be conducted and the expected
results.
Each
projects must culminate in
Ř
A
presentation for the class and
Ř
The
submission of a final report
§
A
soft copy, in word, along with
§
A
hard copy.
READING/REPORT
ASSIGNMENTS
Reference:
Cryptography & Network Security by Stallings, published by
Prentice Hall, second Edition.
1.
Cryptography: Why is it
harder than it looks?
Ref.:
(1) Chapter 1
(2) Why cryptography is harder than it looks
By Bruce Schneier
http://www.counterpane.com/whycrypto.html
2.
CONVENTIONAL ENCRYPTION: CLASSICAL TECHNIQUES
Ref.:
(1) Chapter 2
(2) Steganography.
By Neil F. Johnson
http://www.jjtc.com/stegdoc/index2.html
3.
CONVENTIONAL ENCRYPTION: MODERN TECHNIQUES
Ref.:
(1) Chapter 3
(2) Minimal Key Lengths for Symmetric
Ciphers to provide Adequate Commercial Security.
By Matt Blaze, Whitfield Diffie, Ronald
L.Rivest, Bruce Schneier, Tsutomu Shimomura, Eric Thompson, and Michael Wiener
http://www.counterpane.com/keylength.pdf
4.
CONVENTIONAL ENCRYPTION: ALGORITHMS
Ref.:
(1) Chapter 4
(2) Tea: Tiny Encryption Algorithm
http://www.cl.cam.ac.uk/ftp.papers/djw-rmn-tea.html
5.
CONFIDENTIALITY USING CONVENTIONAL ENCRYPTION
Ref.:
(1) Chapter 5
(2) RFC 1750 Randomness Recommendations for
Security December 1994
http://www.ietf.org/rfc/rfc1750.txt
6.
PUBLIC-KEY CRYPTOGRAPHY
Ref.:
(1) Chapter 6
(2) Asymmetric Encryption: Evolution and
Enhancements
Cryptobytes Volume 2, No.1 – spring 1996 (pdf,
210k)
http://security.ece.orst.edu/koc/ece575/rsalabs/crypto2n1.pdf
7.
INTRODUCTION TO NUMBER THEORY
Ref.:
(1) Chapter 7
(2) Some primality testing algorithms,
By Richard Pinch AMS Notices, 40, no.9 (Nov
1993)
http://www.chalcedon.demon.co.uk/publish.html#42
8.
MESSAGE AUTHENTICATION AND HASH FUCTION
Ref.:(1)
Chapter 8
(2) A logic of Authentication, SRC Research
Report 39
http://www.research.compaq.com/SRC/publications/cartoons/src-rr-039.html
9.
HASH AND MAC ALGORITHMS
Ref.:(1)
Chapter 9
(2) Tiger: A fast New Hash Function,
Fast Software Encryption 3, 1996, LNCS 1039
http://www.cs.technion.ac.il/~biham/Reports/Tiger/
10.
DIGITAL
SIGNATURES AND AUTHENTICATION PROTOCOLS
Ref.:
(1) Chapter 10
(2) “Digital Signatures: A tutorial
Survey.” Computer, February 1983
Leddy Library, Call Number: QA76.C5671
11.
AUTHENTICATION APPLICATIONS
Ref.:(1)
Chapter 11
(2) Kerberos: An Authentication Service for
Open Network Systems.
In proceeding of the Winter 1988 usenix
Conference. February, 1988
By J.G. Steiner, B. Clifford Neuman, and
J.I.Schiller
http://web.mit.edu/kerberos/www/papers.html
12.
ELECTRONIC MAIL SECURITY
Ref.
(1) Chapter 12
(2) Security, Payment, and privacy for
Network Commerce
By B.
Clifford Neuman IEEE
Journal on selected areas in
Communications, 13(8):1523-1531.October
1995.
http://ieeexplore.ieee.org/lpdocs/epic03/VSearch.htm
(On campus computers)
13.
IP SECURITY
Ref.:
(1) Chapter 13
(2) A Security Architecture for the internet
Protocol
By
Cheng et al IBM Systems Journal, No.1, 1998
http://www.research.ibm.com/journal/sj/371/cheng.html
14.
WEB SECURITY
Ref.
(1) Chapter 14
(2) Achieving Electronic Privacy
By David Chaum Scientific American, August
1992
http://ntrg.cs.tcd.ie/mepeirce/project/chaum/sciam.html
15.
INTRUDERS AND VIRUSES
Ref.:
(1) Chapter 15
(2) There be Dragons
By Steven M. Bellovin. ATT.COM. August 15,
1992.
http://www.research.att.com/~smb/papers
16.
FIREWALLS
Ref.:
(1) Chapter 16
(2) Firewalls Fends Off Invasion from the
Net
By Lodin and Schuba IEEE Spectrum, February
1998.
http://ieeexplore.ieee.org/lpdocs/epic03/VSearch.htm
(On campus computers)
|
