Scribd
Upload
37 views

ENCS4320 Applied+Cryptography First+semester2022 23

This syllabus outlines an applied cryptography course that will cover cryptographic primitives, symmetric and asymmetric encryption algorithms, secure hash functions, digital signatures, and key management. The 3-credit course has no lab component and will be taught by Dr. Ahmad Alsadeh. Students are expected to have taken discrete mathematics and computer programming courses as prerequisites. Coursework will include homework assignments, a midterm exam, and a final exam. Students will learn to apply encryption algorithms, analyze security protocols, and identify and solve engineering problems related to network security.

Uploaded by

marwa toame
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views

ENCS4320 Applied+Cryptography First+semester2022 23

This syllabus outlines an applied cryptography course that will cover cryptographic primitives, symmetric and asymmetric encryption algorithms, secure hash functions, digital signatures, and key management. The 3-credit course has no lab component and will be taught by Dr. Ahmad Alsadeh. Students are expected to have taken discrete mathematics and computer programming courses as prerequisites. Coursework will include homework assignments, a midterm exam, and a final exam. Students will learn to apply encryption algorithms, analyze security protocols, and identify and solve engineering problems related to network security.

Uploaded by

marwa toame
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Faculty of Engineering and Technology

ENCS, Computer Systems Engineering


First semester 2022/2023
SYLLABUS

Course number and name: ENCS4320, Applied Cryptography


Credits and contact hours: Credit: 3 (Lecture: 3, Lab.: 0)
Instructor’s or course coordinator’s name:
• Dr. Ahmad Alsadeh: Office: Masri217, email: [email protected]
• Office hours: please check Rritaj
Textbook:
• Jonathan Katz and Yehuda Lindell: Introduction to Modern Cryptography. (Third Edition),
2021. http://www.cs.umd.edu/~jkatz/imc.html
Useful reference:
• Dan Boneh and Victor Shoup. A Graduate Course in Applied Cryptography (V 0.5),
2020. https://toc.cryptobook.us/
Specific course information
• Description: Cryptographic primitives and how they are applied within security systems, number
theory foundations, finite fields, brief overview of classical cryptographic algorithms, symmetric-
key encryption algorithms, Stream ciphers, Block cipher modes of operation, secure hash
algorithms, message authentication codes, asymmetric ciphers, digital signatures, public key
infrastructure, pseudorandom number generation, and design of cryptographic protocols, such as
user authentication protocols.
• Prerequisites:
o COMP233: Discrete Mathematics
o COMP133: Computer programming
• Core course for Computer Engineering
Specific goals for the course
Upon the successful completion of this course, a student should:
• be familiar with network security threats and countermeasures.
• understand theory of fundamental cryptography, encryption and decryption algorithms.
• apply the encryption algorithms.
• analyze network security protocols.
(ABET) Relationship of course to Computer Engineering Program Student Outcomes:
• (a): Ability to apply mathematics, science and engineering principles.
• (e): Ability to identify, formulate and solve engineering problems.
• (k): Ability to use the techniques, skills and modern engineering tools necessary for engineering
practice.

1
Brief list of topics to be covered (Tentative)
• Overview of the course, Classical Ciphers
• Computational Security
• CPA Security + PRFs
• Message Authentication Codes (MACs)
• Cryptographic Hash Function, HMACs
• Stream Ciphers
• Block Ciphers
• Advanced Encryption Standard (AES), Hash Functions
• One-Way Functions (OWFs)
• Number Theory
• Primes, Factoring and RSA
• Factoring Algorithms.
• Key Management
• Digital Signatures

Grading (Tentative):
• Course Participation: 5% (attendance, participation in lecture, good answers)
• Homework assignments 25%
• Midterm Exam 30%
• Final Exam 40%

Policies:
• No late submissions will be accepted.
• Class attendance is required by the university regulations. Come to All lectures and activities.
• Make-up will be allowed only for students who miss the final exam with an acceptable excuse
according to the university regulations.
• All students are expected to comply with University rules and regulations on academic Integrity
and honesty.

You might also like