CS521 Modern Cryptography
CS521 Modern Cryptography
Syllabus | International University of Sarajevo - Last Update on Feb 02, 2026
Syllabus Quick Jump
Search and navigate to any syllabus instantly
Computer Sciences and Engineering
Amal Mersni
Course Lecturer
Course Objectives
This course presents basic cryptography concepts, from its theoretical foundations to its practical applications. The goal of the course is to introduce the theoretical basis for real-world cryptography, understand security guarantees needed/provided, know how to use cryptography and teach various threats, countermeasures, cryptographic protocols and their implementation.
Learning Outcomes
After successful completion of the course, the student will be able to:
Course Materials
Required Textbook
Introduction to Modern Cryptography by J. Katz and Y. Lindell
Additional Literature
Handbook of Applied Cryptography, by Alfred J.Menezes, Paul C. van Orshoot, Scott A. Vanstone A Graduate Course in Applied Cryptography by Dan Boneh and Victor ShoupTeaching Methods
Classes
Discussion
In-class assignments
Homeworks and reading
Weekly Topics
| Week | Topic | Readings / References |
|---|---|---|
| 1 | Introduction | Chapter 1 |
| 2 | Perfectly secret encryption | Chapter 2 |
| 3 | Private-key encryption | Chapter 3 |
| 4 | Message authentication codes | Chapter 4 |
| 5 | CCA security and authenticated encryption | Chapter 5 |
| 6 | Hash functions and applications | Chapter 6 |
| 7 | Practical constructions of symmetric-key primitives | Chapter 7 |
| 8 | Midterm exam | Chapters 1-7 |
| 9 | Number theory and cryptographic hardness assumptions | Chapter 9 |
| 10 | Key management and the public-key revolution | Chapters 11 |
| 11 | Public-key encryption | Chapter 12 |
| 12 | Digital signature schemes | Chapter 13 |
| 13 | Quantum-secure cryptography | Chapter 14 |
| 14 | Advanced topics in Public-key encryption | Chapter 15 |
| 15 | Algorithms for factoring and computing discrete M logarithms | Chapter 10 |
Course Schedule (All Sections)
| Section | Type | Day 1 | Venue 1 | Day 2 | Venue 2 |
|---|---|---|---|---|---|
| CS521.1 | Course | Thursday 17:00 - 19:50 | A F1.11 | - | - |
Office Hours & Room
Assessment Methods and Criteria
Assessment Components
Final Exam
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3 4 5
Mid-term
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3
Homeworks
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3 4 5
In-class quizzes
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3 4 5
IUS Grading System
| Grading Scale | IUS Grading System | IUS Coeff. | Letter (B&H) | Numerical (B&H) |
|---|---|---|---|---|
| 0 - 44 | F | 0 | F | 5 |
| 45 - 54 | E | 1 | ||
| 55 - 64 | C | 2 | E | 6 |
| 65 - 69 | C+ | 2.3 | D | 7 |
| 70 -74 | B- | 2.7 | ||
| 75 - 79 | B | 3 | C | 8 |
| 80 - 84 | B+ | 3.3 | ||
| 85 - 94 | A- | 3.7 | B | 9 |
| 95 - 100 | A | 4 | A | 10 |
Late Work Policy
Information about late submission policies will be shared during class and posted in this section. Please check back for official guidelines.
ECTS Credit Calculation
📚 Student Workload
This 6 ECTS credit course corresponds to 150 hours of total student workload, distributed as follows:
Lecture hours
45 hours ⏳ (15 week × 3 h)
Home studies
30 hours ⏳ (15 week × 2 h)
In-term exam study
10 hours ⏳ (1 week × 10 h)
Final exam study
15 hours ⏳ (1 week × 15 h)
Home assignment study
20 hours ⏳ (10 week × 2 h)
Reading before lecture
30 hours ⏳ (15 week × 2 h)
150 Total Workload Hours
6 ECTS Credits
Course Policies
Academic Integrity
All work submitted must be your own. Plagiarism, cheating, or any form of academic dishonesty will result in disciplinary action according to university policies. When in doubt about citation practices, consult the instructor.
Attendance Policy
Students are expected to adhere to the attendance requirements as outlined in the International University of Sarajevo Study Rules and Regulations. Excessive absences, whether excused or unexcused, may impact academic performance and eligibility for assessment. Mandatory sessions (e.g., labs, workshops) require attendance unless formally exempted. For detailed policies on absences, documentation, and penalties, please refer to the official university regulations.
Technology & AI Policy
Laptops/tablets may be used for note-taking only during lectures. Phones should be silenced and put away during all class sessions. Audio/video recording requires prior permission from the instructor.
Artificial Intelligence (AI) Usage: The use of AI tools (e.g., ChatGPT, Copilot, Gemini) varies by assessment component. Please refer to the AI usage indicator next to each assessment item in the Assessment Methods and Criteria section above. Submitting AI-generated content as your own work, where AI is not explicitly allowed, constitutes an academic integrity violation.
Communication Policy
All course-related communication should occur through official university channels (institutional email or SIS). Emails should include [CS521] in the subject line.
Academic Quality Assurance Policy
Course Academic Quality Assurance is achieved through Semester Student Survey. At the end of each academic year, the institution of higher education is obliged to evaluate work of the academic staff, or the success of realization of the curricula.
Learning Tips
Be prepared to contribute thoughtfully during class discussions, labs, or collaborative work. Active participation deepens understanding and encourages critical thinking.
Complete assigned readings or prep materials before class. Take notes, highlight key ideas, and jot down questions. Aim to grasp core concepts and their applications—not just facts.
Use course frameworks or methodologies to analyze problems, case studies, or projects. Begin early to allow time for reflection and refinement. Seek feedback to improve your work.
Don’t hesitate to reach out when something is unclear. Use office hours, discussion boards, or peer networks to clarify concepts and stay on track.
Syllabus Last Updated on Feb 02, 2026 | International University of Sarajevo
Print Syllabus
Referencing Curricula Print this page
| Course Code | Course Title | Weekly Hours* | ECTS | Weekly Class Schedule | ||||||
| T | P | |||||||||
| CS521 | Modern Cryptography | 3 | 0 | 6 | ||||||
| Prerequisite | None | It is a prerequisite to | - | |||||||
| Lecturer | Amal Mersni | Office Hours / Room / Phone | ||||||||
| amersni@ius.edu.ba | ||||||||||
| Assistant | Assistant E-mail | |||||||||
| Course Objectives | This course presents basic cryptography concepts, from its theoretical foundations to its practical applications. The goal of the course is to introduce the theoretical basis for real-world cryptography, understand security guarantees needed/provided, know how to use cryptography and teach various threats, countermeasures, cryptographic protocols and their implementation. |
|||||||||
| Textbook | Introduction to Modern Cryptography by J. Katz and Y. Lindell | |||||||||
| Additional Literature |
|
|||||||||
| Learning Outcomes | After successful completion of the course, the student will be able to: | |||||||||
|
||||||||||
| Teaching Methods | Classes, discussion, in-class assignments, homeworks and reading | |||||||||
| Teaching Method Delivery | Face-to-face | Teaching Method Delivery Notes | ||||||||
| WEEK | TOPIC | REFERENCE | ||||||||
| Week 1 | Introduction | Chapter 1 | ||||||||
| Week 2 | Perfectly secret encryption | Chapter 2 | ||||||||
| Week 3 | Private-key encryption | Chapter 3 | ||||||||
| Week 4 | Message authentication codes | Chapter 4 | ||||||||
| Week 5 | CCA security and authenticated encryption | Chapter 5 | ||||||||
| Week 6 | Hash functions and applications | Chapter 6 | ||||||||
| Week 7 | Practical constructions of symmetric-key primitives | Chapter 7 | ||||||||
| Week 8 | Midterm exam | Chapters 1-7 | ||||||||
| Week 9 | Number theory and cryptographic hardness assumptions | Chapter 9 | ||||||||
| Week 10 | Key management and the public-key revolution | Chapters 11 | ||||||||
| Week 11 | Public-key encryption | Chapter 12 | ||||||||
| Week 12 | Digital signature schemes | Chapter 13 | ||||||||
| Week 13 | Quantum-secure cryptography | Chapter 14 | ||||||||
| Week 14 | Advanced topics in Public-key encryption | Chapter 15 | ||||||||
| Week 15 | Algorithms for factoring and computing discrete M logarithms | Chapter 10 | ||||||||
| Assessment Methods and Criteria | Evaluation Tool | Quantity | Weight | Alignment with LOs | AI Usage |
| Final Exam | 1 | 30 | 1,2,3,4,5 | Not Allowed | |
| Semester Evaluation Components | |||||
| Mid-term | 1 | 30 | 1,2,3 | Not Allowed | |
| Homeworks | 5 | 30 | 1,2,3,4,5 | Not Allowed | |
| In-class quizzes | 10 | 10 | 1,2,3,4,5 | Not Allowed | |
| *** ECTS Credit Calculation *** | |||||
| Activity | Hours | Weeks | Student Workload Hours | Activity | Hours | Weeks | Student Workload Hours | |||
| Lecture hours | 3 | 15 | 45 | Active tutorials | 0 | 15 | 0 | |||
| Home studies | 2 | 15 | 30 | In-term exam study | 10 | 1 | 10 | |||
| Final exam study | 15 | 1 | 15 | Home assignment study | 2 | 10 | 20 | |||
| Reading before lecture | 2 | 15 | 30 | |||||||
| Total Workload Hours = | 150 | |||||||||
| *T= Teaching, P= Practice | ECTS Credit = | 6 | ||||||||
| Course Academic Quality Assurance: Semester Student Survey | Last Update Date: 21/02/2026 | |||||||||