CSCI 860: Special Topics - Data Security & Cryptography

CSCI 860 Special Topics: Data Security & Cryptography

Spring Term 2005

New York Institute of Technology


  • CSCI 860 Class room is: C2 011
  • Project Details are posted on the web
  • HW1 is posted
  • Midterm Examination information are posted now on the web. Due date: Wed 8/6/2005 by 5:00 PM.
  • Final Examination  information are posted now on the web. Due date: SAT  25/6/2005 by 5:00 PM.

Homework Assignments

  • Homework #1 -Due by 5:00 pm Tuesday, May 24 
    Section 2.13 Exercises: 10, 15
    Section 2.14 Computer Problems: 2, 8, 13
    Section 4.8  Exercises: 4, 5, 6

Homework assignments must be submitted by e-mail. Send Text, Image, MS Word, or PDF files.
Please name your file as your last name followed by homework number, for example, tawalbeh-hw1.pdf.
Also make sure that your name is printed within the homework file.


Midterm Examination:

Final Examination:

Plan of the Course

  • Week 1: Introduction and general overview of the course.
  • Week 2: Overview and Classical Cryptosystems (Chapters 1 and 2)
  • Week 3: Basic Number Theory (Chapter 3)
  • Week 4: Data Encryption Standard (Chapter 4)
  • Week 5: Advanced Encryption Standard (Chapter 5)
  • Week 6: RSA Algorithm (Chapter 6)
  • Week 7: Discrete Logarithms and Digital Signatures (Chapters 7 and 8)
  • Week 8: Elliptic Curve Cryptography (Chapter 15)
  • Week 9: Digital Cash, Secret Sharing Schemes (Chapters 9 and 10)
  • Week 10: Cryptographic Games, Zero-Knowledge Techniques (Chapters 11 and 12)

Course Handouts

  • Public-Key Cryptography   PDF1 &
  • Fair Cryptography   PDF1 &
  • RSA Implementation   PDF1 &
  • Elliptic Curve Cryptosystems   PDF1 &
  • Next Generation E-Commerce Security   PDF
  • Emerging Applications of Cryptography   PDF
  • High-Speed Cryptography   PDF
  • Wireless Security Implementation   PDF
  • Advanced Encryption Standard   PDF
  • Introduction to Rijndael   PDF
  • CRT and Inverse Computation   PDF

Resources and Pointers


This is an introductory course on the methods, algorithms, techniques, and tools of data security and cryptography. After studying the theoretical aspects of cryptographic algorithms and protocols, we show how these techniques can be integrated to solve particular data and communication security problems. This course material is of use to computer and communication engineers who are interested in embedding security into an information system, and thus, providing integrity, confidentiality, and authenticity of the documents and the communicating parties.


  • Introduction and Classical Cryptosystems: Secure communication. Attacks to cryptosystems. Classical cryptographic techniques and algorithms. Monoalphabetic and polyalphabetic systems.
  • Mathematical Foundations: Number theory. Finite fields. Primitive roots. Squareroots. Exponentiation and discrete logarithm.
  • Secret-Key Cryptography: Block ciphers and stream ciphers. DES, AES, RC4. Modes of operation.
  • Public-Key Cryptography: One-way functions. Trapdoor one-way functions. Public-key cryptosystems. RSA, Diffie-Hellman, ElGamal, and elliptic curve cryptosystems.
  • Authentication and Digital Signatures: Cryptographic checksums. Hash functions and message-digest functions. Digital signatures. Authentication protocols.
  • Protocols: Digital cash. Sharing and partial disclosure of secrets. Games. Zero-knowledge proof systems. Identification protocols. Key management architectures.



More Information about the Textbook

Maple & Cryptography Links

Grading Policy

  • HW Assignments: 20 %
  • Midterm: 25 %
  • Project: 25 %
  • Final : 30%


This class is open to all graduate students.

Dr. Lo'ai A. Tawalbeh