|Professors||Christos Xenakis Angeliki Panou|
|Lecture hours||3 hours|
|Lab hours||2 hours|
|Digital resources||View on Aristarchus (Open e-Class)|
The aim of this course is to support the students in learning the principles, concepts and applications of cryptography.
Upon successful completion of the course the student will be able:
- to handle the basic elements of numerical theory and modular arithmetic
- to manage cryptographic algorithms and their properties
- basic cryptographic functions, such as pseudo-random sequences, one-way hash functions, shift and displacement networks and feistel networks.
- the main features for symmetric and asymmetric cryptography are familiar
- to handle key management systems and digital signatures
- Basic definitions and concepts; information security.
- Symmetric cryptography.
- Digital signatures.
- Public key cryptography.
- Hash functions.
- Integrity checking.
- Key management and random number generators.
- Schneier B. (1996): Applied Cryptography, 2nd Edition, John Wiley & Sons.
- Stallings W. (2006): Cryptography and Network Security, 4th Edition, Prentice Hall.