0% found this document useful (0 votes)
26 views2 pages

Applied Cryptography Syllabus ENCS4320

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
0% found this document useful (0 votes)
26 views2 pages

Applied Cryptography Syllabus ENCS4320

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

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: asadeh@[Link]
• Office hours: please check Rritaj
Textbook:
• Jonathan Katz and Yehuda Lindell: Introduction to Modern Cryptography. (Third Edition),
2021. [Link]
Useful reference:
• Dan Boneh and Victor Shoup. A Graduate Course in Applied Cryptography (V 0.5),
2020. [Link]
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.

Common questions

Powered by AI

The course integrates modern engineering tools and skills by addressing engineering principles through the application of cryptographic algorithms, network security analysis, and protocol design. These approaches align with the outcomes that require using modern engineering tools necessary for practical engineering practice .

Knowledge of primes, factoring, and RSA equips students with the ability to understand and solve complex engineering problems that involve encryption and decryption processes. This understanding supports secure communication and data protection protocols taught in the course .

The course emphasizes understanding network security threats, such as eavesdropping and data tampering, and cryptographic countermeasures like encryption, digital signatures, and message authentication codes. These countermeasures are designed to ensure confidentiality, integrity, and authenticity of data .

Understanding CPA security and PRFs is vital for students to comprehend how cryptographic systems maintain security against adaptive chosen-plaintext attacks. These concepts are critical for analyzing the security properties of encryption schemes taught in the course .

Digital signatures play a crucial role in achieving authenticity and non-repudiation in cryptographic protocols. The course teaches the principles of digital signature algorithms and their integration into security systems to verify the sender's identity and protect data integrity .

The course structure includes topics on number theory, asymmetric ciphers, and public key infrastructure, which are fundamental to secure key management. This comprehensive approach enables students to understand key management challenges and implement secure key distribution and exchange protocols .

By the end of the course, students are expected to understand and apply cryptographic hash functions, including constructing secure hash algorithms (such as HMACs) and analyzing their role in ensuring data integrity and authentication within security protocols .

The applied cryptography course offers insight into the latest cryptographic algorithms and protocols, which are essential for identifying and mitigating real-world network security challenges. Students learn to apply this knowledge to devise solutions that enhance the security of contemporary networking systems .

Computational security is crucial in cryptographic protocol design, as it quantifies the infeasibility of breaking a cryptographic scheme using polynomial-time resources. This course covers computational security concepts, such as CPA security and pseudorandom functions, to analyze the strength and limitations of cryptographic systems .

Understanding cryptographic systems in this course requires a foundation in number theory and finite fields, which underpin many cryptographic primitives and algorithms .

You might also like