| Statuss(Aktīvs) | Izdruka | Arhīvs(0) | Studiju plāns Vecais plāns | Kursu katalogs | Vēsture |
| Course title | Data Security |
| Course code | InfT4026 |
| Credit points (ECTS) | 3 |
| Total Hours in Course | 81 |
| Number of hours for lectures | 16 |
| Number of hours for seminars and practical classes | 16 |
| Independent study hours | 49 |
| Date of course confirmation | 06/09/2022 |
| Responsible Unit | Institute of Computer Systems and Data Science |
| Course developers | |
| Dr. habil. sc. ing., prof. Pēteris Rivža |
|
| There is no prerequisite knowledge required for this course | |
| Course abstract | |
| The aim of the study course is to familiarize students with the basic concepts, algorithms, protocols, standards and methods of cryptography and their applications in data protection. In practical work, students learn practical skills in using cryptography and data protection methods. | |
| Learning outcomes and their assessment | |
| As study course acquirement results students get:
Knowledge about math cryptography algorithm using possibilities for data security, those realization resources and practical usage facility for network security; Skills in using in practice information security resources and independent constructing “public keys” encryption algorithm; Competence in working in groups or performing work individually, using information security methods and resources, also in discussing colleagues’ opinion and disputing it. |
|
| Course Content(Calendar) | |
| 1. Problems to be solved in cryptography, basic concepts and classification of cryptographic algorithms. Classic information coding systems (lectures-1h, practical works-1h).
2. Symmetric encryption algorithms (lectures-1h, practical works-1h). 3. Asymmetric encryption algorithms (lectures-1h, practical work-1h). 4. Hash functions (lectures-1h, practical work-1h). 5. Key management (lectures-1h, practical works-1h). 6. Public-Key Infrastructures (PKI) (lectures-1h, practical work-1h) . 7. Digital signature (lectures-1h). 8. Standards and protocols used in Internet communication (lectures-1h, practical works-1h). 9. Security of wireless networks (lectures-1h). 10. Electronic mail security (lectures-1h).. 11. Security at IP level (lectures-1h, practical work-1h). 12. Malicious Software (lectures-1h, practical works-1h). 13. Offenders. Hacking methodology. Detection of offenders (lectures-1h, practical works-1h). 14. Firewalls (lectures-1h, practical works-1h). 15. Cloud computing security (lectures-1h). 16. Legal and ethical issues of data protection (lectures-1h). |
|
| Requirements for awarding credit points | |
| Final evaluation depends on the cumulative assessment of the semester:
•1th Test: 35 points •2th Test: 35 points •Independent work: 30 points 10 points constitute pass mark 1 ball. If the student is not satisfied at the end of accumulated cumulative score can take the test work for all the substances. Tests can be made only at a specified time. For the final evaluation of all the practical work should be counted. |
|
| Description of the organization and tasks of students’ independent work | |
| The student chooses a topic from the proposed topics of cryptography and data protection (can offer his / her own topic) and prepares a report (10-15 pages) and a presentation. Both the report and the presentation with a presentation are evaluated. | |
| Criteria for Evaluating Learning Outcomes | |
| The final mark of the course consists of 2 marks of a test and a mark of a permanent work. | |
| Compulsory reading | |
| 1. Stallings W. Cryptography and Network Security: Principles and Practices. 7th edition. Person Education, 2020. 768 p. 2. Paar C., Pelzl J. Understanding Cryptography: A textbook for Students and Practitioners. Heidelberg; New York: Springer-Verlag, 2022. 390 p.(DSK bibliotēka) | |
| Further reading | |
| 1. Schneier B. Applied Cryptography. Protocols, Algorithms, and Source Code in C. Indianapolis, IN : Wiley, 2015. 758 p.
2. Smart N. Cryptography: An Introduction. McGraw-Hill College, 2004. 433 p. 3. Smart N. Cryptography Made Simple. Cham: Springer, 2016. 481 pp. 4. Mittelbach A., Fischlin M. The Theory of Hash Functions and Random Oracles An Approach to Modern Cryptography. Cham: Springer, 2021. 788 p. 5. van Oorschot P. C. Computer Security and the Internet Tools and Jewels from Malware to Bitcoin. Cham: Springer, 2021. 446 p. 6. Beaver K. Hacking For Dummies. 6th Edition. 2018. 416 p.(DSK bibliotēka) |
|
| Periodicals and other sources | |
| Technical Resource and Course Web Site for Cryptography and Network Security. Pieejams: http://www.williamstallings.com/Crypto3e.html | |
| Notes | |
| Compulsory course in Computer Science and Computer Science and Information Technology for Sustainable Development. | |