CS416 Cryptography
CS416 Cryptography
Syllabus | International University of Sarajevo - Last Update on Mar 03, 2026
Syllabus Quick Jump
Search and navigate to any syllabus instantly
Computer Sciences and Engineering
TBA
Course Lecturer
Course Objectives
This course introduces basic concepts in cryptography and discusses both theoretical foundations and practical applications. The course will cover fundamentals of cryptography, stream ciphers: OTP, LFSR, Trivium; block ciphers: DES, 3DES, AES, block cipher modes; public-key cryptosystems: RSA, Diffie–Hellman key exchange, Elgamal public-key cryptosystems; elliptic curve cryptosystems; digital signatures; hash functions; message authentication codes.
Learning Outcomes
After successful completion of the course, the student will be able to:
Course Materials
Required Textbook
Christof Paar, Jan Pelzl (2010) Understanding Cryptography - A Texbook for Students and Practitioners, Springer-Verlag, Berlin Heidelberg, ISBN 978-3-642-04100-6
Additional Literature
Teaching Methods
Class lecturing and discussions with examples
Active laboratory and tutorial sessions for engaged learning and continuous feedback on progress
Group projects on the applications of learned concepts and methods
Weekly Topics
| Week | Topic | Readings / References |
|---|---|---|
| 1 | Introduction to Cryptography: Overview; Modular Arithmetic; Historical Cryptosystems | Chapter 1 |
| 2 | Stream Ciphers: Random Numbers; Unbreakable Stream Cipher; OTP | Chapter 2 |
| 3 | Stream Ciphers: Sift Register Based Stream Ciphers; LFSR; Trivium | Chapter 2 |
| 4 | The Data Encryption Standard (DES): Structure of DES; Security of DES; DES Alternatives | Chapter 3 |
| 5 | Galois Fields: Prime Fields; Extension Fields; Operations in Extension Fields | Chapter 4 |
| 6 | The Advanced Encryption Standard (AES): Galois Fields, Structure of AES; Decryption | Chapter 4 |
| 7 | Block Cipher Modes: ECB; CBC; OFB; CFB; CTR; GCM; Increasing the Security of Block Ciphers | Chapter 5 |
| 8 | Midterm Examination: Revision; Preparation and Examination | |
| 9 | Public-Key Cryptography: Practical Aspects of Public-Key Cryptography; Number Theory | Chapter 6 |
| 10 | The RSA Cryptosystem: Encryption and Decsryption; Key Generation; Primality Tests | Chapter 7 |
| 11 | Diffie-Hellman Key Exchange: The Discrete Logarithm Problem; Elgamal Encyption Scheme | Chapter 8 |
| 12 | Elliptic Curve Cryptosystem: Elliptic Curves; Diffie-Hellman Key Exchange with Elliptic Curves | Chapter 9 |
| 13 | Digital Signatures: RSA Digital Signature; Elgamal Digital Signature; Digital Signature Algorithm | Chapter 10 |
| 14 | Hash Functions: Security Requirements; Hash Algorithms; SHA-1/2 | Chapter 11 |
| 15 | Message Authentication Codes (MAC): HMAC; CBC-MAC; GMAC | Chapter 12 |
Course Schedule (All Sections)
Office Hours & Room
Assessment Methods and Criteria
Assessment Components
Final Exam
AI: Not AllowedAlignment with Learning Outcomes : 1 4
Home Assignments
AI: Not AllowedAlignment with Learning Outcomes : 2 3
In-term Examination
AI: Not AllowedAlignment with Learning Outcomes : 1 3
Quizzes
AI: Not AllowedAlignment with Learning Outcomes : 1 2
Group Projects
AI: Not AllowedAlignment with Learning Outcomes : 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)
Active Tutorials
30 hours ⏳ (15 week × 2 h)
Home Study
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)
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 [CS416] 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 Mar 03, 2026 | International University of Sarajevo
Print Syllabus
Referencing Curricula Print this page
| Course Code | Course Title | Weekly Hours* | ECTS | Weekly Class Schedule | ||||||
| T | P | |||||||||
| CS416 | Cryptography | 3 | 2 | 6 | Tue: 16:00 - 16.50 Thu: 15:00 - 16:50 | |||||
| Prerequisite | MATH204, CS302 | It is a prerequisite to | - | |||||||
| Lecturer | Office Hours / Room / Phone | Currently not available |
||||||||
| Assistant | Armin Basic | Assistant E-mail | basic.armin1@gmail.com | |||||||
| Course Objectives | This course introduces basic concepts in cryptography and discusses both theoretical foundations and practical applications. The course will cover fundamentals of cryptography, stream ciphers: OTP, LFSR, Trivium; block ciphers: DES, 3DES, AES, block cipher modes; public-key cryptosystems: RSA, Diffie–Hellman key exchange, Elgamal public-key cryptosystems; elliptic curve cryptosystems; digital signatures; hash functions; message authentication codes. | |||||||||
| Textbook | Christof Paar, Jan Pelzl (2010) Understanding Cryptography - A Texbook for Students and Practitioners, Springer-Verlag, Berlin Heidelberg, ISBN 978-3-642-04100-6 | |||||||||
| Additional Literature | ||||||||||
| Learning Outcomes | After successful completion of the course, the student will be able to: | |||||||||
|
||||||||||
| Teaching Methods | Class lecturing and discussions with examples. Active laboratory and tutorial sessions for engaged learning and continuous feedback on progress. Group projects on the applications of learned concepts and methods. | |||||||||
| Teaching Method Delivery | Teaching Method Delivery Notes | |||||||||
| WEEK | TOPIC | REFERENCE | ||||||||
| Week 1 | Introduction to Cryptography: Overview; Modular Arithmetic; Historical Cryptosystems | Chapter 1 | ||||||||
| Week 2 | Stream Ciphers: Random Numbers; Unbreakable Stream Cipher; OTP | Chapter 2 | ||||||||
| Week 3 | Stream Ciphers: Sift Register Based Stream Ciphers; LFSR; Trivium | Chapter 2 | ||||||||
| Week 4 | The Data Encryption Standard (DES): Structure of DES; Security of DES; DES Alternatives | Chapter 3 | ||||||||
| Week 5 | Galois Fields: Prime Fields; Extension Fields; Operations in Extension Fields | Chapter 4 | ||||||||
| Week 6 | The Advanced Encryption Standard (AES): Galois Fields, Structure of AES; Decryption | Chapter 4 | ||||||||
| Week 7 | Block Cipher Modes: ECB; CBC; OFB; CFB; CTR; GCM; Increasing the Security of Block Ciphers | Chapter 5 | ||||||||
| Week 8 | Midterm Examination: Revision; Preparation and Examination | |||||||||
| Week 9 | Public-Key Cryptography: Practical Aspects of Public-Key Cryptography; Number Theory | Chapter 6 | ||||||||
| Week 10 | The RSA Cryptosystem: Encryption and Decsryption; Key Generation; Primality Tests | Chapter 7 | ||||||||
| Week 11 | Diffie-Hellman Key Exchange: The Discrete Logarithm Problem; Elgamal Encyption Scheme | Chapter 8 | ||||||||
| Week 12 | Elliptic Curve Cryptosystem: Elliptic Curves; Diffie-Hellman Key Exchange with Elliptic Curves | Chapter 9 | ||||||||
| Week 13 | Digital Signatures: RSA Digital Signature; Elgamal Digital Signature; Digital Signature Algorithm | Chapter 10 | ||||||||
| Week 14 | Hash Functions: Security Requirements; Hash Algorithms; SHA-1/2 | Chapter 11 | ||||||||
| Week 15 | Message Authentication Codes (MAC): HMAC; CBC-MAC; GMAC | Chapter 12 | ||||||||
| Assessment Methods and Criteria | Evaluation Tool | Quantity | Weight | Alignment with LOs | AI Usage |
| Final Exam | 1 | 35 | 1,4 | Not Allowed | |
| Semester Evaluation Components | |||||
| Home Assignments | 4 | 20 | 2,3 | Not Allowed | |
| In-term Examination | 1 | 25 | 1,3 | Not Allowed | |
| Quizzes | 2 | 10 | 1,2 | Not Allowed | |
| Group Projects | 1 | 10 | 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 | 2 | 15 | 30 | |||
| Home Study | 2 | 15 | 30 | In-term Exam study | 10 | 1 | 10 | |||
| Final Exam Study | 15 | 1 | 15 | Home Assignment Study | 2 | 10 | 20 | |||
| Total Workload Hours = | 150 | |||||||||
| *T= Teaching, P= Practice | ECTS Credit = | 6 | ||||||||
| Course Academic Quality Assurance: Semester Student Survey | Last Update Date: 27/03/2026 | |||||||||