CPE 776: Security & Cryptography

Fall Term 2011

Jordan University of Science and Technology-JUST



  • Class room is: C2006
  • My office hours: Sun, Tue, 11:15-12:15 AM and Wed 13:00-14:00, or by appointment.

  • My office: E1 Level 3

  • Project Details are posted on the web
  • Project abstract and title are due: 20 October 2011
  • Alice and Bob: Security's inseparable couple .

  • Check this Latex Tutorial
  • The figures commands in Latex are here

  • The Midterm exam : 17/11/2011.
  • Suggested topics are posted in the project section
  • Report grading policy: the project grades basis (compile, simulate and the report) doesn't only include these three factors. They extend to many other points such as the difficulty index and the ability to conduct the job professionally and many others. Please see below.




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.

Course Description

Covers the fundamentals of data network security. Covers concepts of data security through different algorithms. Different concepts on cryptographic systems (software and hardware) are classified. Shift register sequences and DES, are introduced. The concepts of public and private key cryptography is developed. Aspects of cryptographic hardware and embedded system design. Covers new methods for efficient hardware implementations of high-speed embedded systems, e.g., smart cards, cryptographic processors and co-processors, special-purpose hardware for cryptanalysis, DSP chips, etc.  


  • 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.

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

  • Overview and General Concepts   PDF1, PDF2 ,
  • Classical Cryptosystems PDF1
  • Data Encryption Standard PDF1
  • Public-Key Cryptography   PDF1
  • Diffie_Helman  PPT1
  • Fair Cryptography   PDF1
  • RSA Implementation   PDF1
  • Diffie_Helman  PPT1
  • 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 Animation  Flash
  • Introduction to Rijndael   PDF
  • CRT and Inverse Computation   PDF
  • IEEE draft PDF
  • Hash and Mac functions PDF

Resources and Pointers

Homework Assignments

  • HW1: Due:   Please solve the following question from the text book
         Section 2.13: Exercises : 2, 6, 12.
         Section 2.14: Computer Problems: 3, 5, 10.
  • HW2: Due :  Please solve the following question from the text book

         Section 3.11: Exercises : 7, 9, 10, 14, 15
         Section 3.12: Computer Problems:  5, 9, 10.

  • HW3: Due : Please solve the following question from the text book

         Section 4.8: Exercises : 1, 4, 6
         Section 6.8: Exercise: 3, 5, 6, 7
         Section 6.9: Computer Problems:  2, 10.

  • HW4: Due :  Please solve the following question from the text book

         Section 7.6 : Computer Problems: 1, 2
         Section 15.6: Exercise: 2,10
         Section 15.7: Computer Problems: 1, 2, 5

Homework assignments must be submitted by e-mail to: tawalbeh@just.edu.jo. Send Text, Image, MS Word, or PDF files. Please name your file as your last name followed by homework number, followed by course number (776), for example, tawalbeh-hw1-776.pdf.
Also make sure that your name and number is printed within the homework file.


Midterm Examination:

  • TBA

Final Examination:

  • TBA


More Information about the Textbook

Maple & Cryptography Links

Grading Policy

  • HW Assignments + Presentation: 20 %
  • Midterm: 20 %
  • Project (research paper and implementation): 30 %
  • Final : 30%


This class is open to all graduate students.

Dr. Lo'ai A. Tawalbeh