ITC8240 Cryptography (2021) - Redigeerimiste ajalugu

Ahto: /* Topics */

2021-08-23T10:35:35Z

Topics

Ahto: /* Topics */

2021-08-23T10:32:24Z

Topics

Ahto: Uus lehekülg: '== Course information == Code: ITC8240 Cryptography ECTS: 6 Assessment: examination Instructors: * Ahto Buldas ahto dot buldas at taltech dot ee * Nikita Snetkov nikita dot ...'

2021-08-23T10:28:55Z

Uus lehekülg: '== Course information == Code: ITC8240 Cryptography ECTS: 6 Assessment: examination Instructors: * Ahto Buldas ahto dot buldas at taltech dot ee * Nikita Snetkov nikita dot ...'

Uus lehekülg

== Course information ==

Code: ITC8240 Cryptography

ECTS: 6

Assessment: examination

Instructors:
* Ahto Buldas ahto dot buldas at taltech dot ee
* Nikita Snetkov nikita dot snetkov at taltech dot ee

== Topics ==

1. Introduction to the course
2. Simple (classical) ciphers: substitution, permutation, shift, affine, Vigenere
3. Attacks against classical ciphers: attack types, basic attacks, attacks against Vigenere
4. Theory of unbreakable ciphers I: basic conceptes of information theory
5. Theory of unbreakable ciphers II: proof that one-time pad is unbreakable, attacks against imperfect ciprers, unicity distance
6. Block ciphers: basic architectures, execution modes, etc.
7. Key establishment: definition, proof that no key establishment protocol is secure against unlimited adversaries, DH key exchange idea
8. Limited adversaries I: complexity theoretic approach to adversaries, complexity classes P and NP
9. Limited adversaries II: randomized computations, related complexity classes, Chernoff bounds, etc.
10. RSA cryptosystem: definition and related mathematical concepts
11. RSA implementation failures: some examples how RSA should not be implemented
12. Some other public key cryptosystems: ElGamal and related, EC cryptosystems, Paillier?
13. Digital signature schemes and hash functions: security notions, paddings, hash function basics
14. Cryptographic protocols: authentication, zero knowledge, etc.
15. Quantum adversaries: concept, some results without proofs (Shor, Grover) and their security implications. Post-quantum cryptosystems (overview)

== E-learning process and grading criteria ==

'''Lectures''':

'''Practice''':

'''Homeworks''':

'''Grading''':

'''Communication''':

@@ 13. rida: / 13. rida: @@
 == Topics ==
-# Introduction to the course
+# '''Introduction to the course'''
-# Simple (classical) ciphers: substitution, permutation, shift, affine, Vigenere
+# '''Simple (classical) ciphers''': substitution, permutation, shift, affine, Vigenere
-# Attacks against classical ciphers: attack types, basic attacks, attacks against Vigenere
+# '''Attacks against classical ciphers''': attack types, basic attacks, attacks against Vigenere
-# Theory of unbreakable ciphers I: basic conceptes of information theory
+# '''Theory of unbreakable ciphers I''': basic conceptes of information theory
-# Theory of unbreakable ciphers II: proof that one-time pad is unbreakable, attacks against imperfect ciprers, unicity distance
+# '''Theory of unbreakable ciphers II''': proof that one-time pad is unbreakable, attacks against imperfect ciprers, unicity distance
-# Block ciphers: basic architectures, execution modes, etc.
+# '''Block ciphers''': basic architectures, execution modes, etc.
-# Key establishment: definition, proof that no key establishment protocol is secure against unlimited adversaries, DH key exchange idea
+# '''Key establishment''': definition, proof that no key establishment protocol is secure against unlimited adversaries, DH key exchange idea
-# Limited adversaries I: complexity theoretic approach to adversaries, complexity classes P and NP
+# '''Limited adversaries I''': complexity theoretic approach to adversaries, complexity classes P and NP
-# Limited adversaries II: randomized computations, related complexity classes, Chernoff bounds, etc.
+# '''Limited adversaries II''': randomized computations, related complexity classes, Chernoff bounds, etc.
-# RSA cryptosystem: definition and related mathematical concepts
+# '''RSA cryptosystem''': definition and related mathematical concepts
-# RSA implementation failures: some examples how RSA should not be implemented
+# '''RSA implementation failures''': some examples how RSA should not be implemented
-# Some other public key cryptosystems: ElGamal and related, EC cryptosystems, Paillier?
+# '''Some other public key cryptosystems''': ElGamal and related, EC cryptosystems, Paillier?
-# Digital signature schemes and hash functions: security notions, paddings, hash function basics
+# '''Digital signature schemes and hash functions''': security notions, paddings, hash function basics
-# Cryptographic protocols: authentication, zero knowledge, etc.
+# '''Cryptographic protocols''': authentication, zero knowledge, etc.
-# Quantum adversaries: concept, some results without proofs (Shor, Grover) and their security implications. Post-quantum cryptosystems (overview)
+# '''Quantum adversaries''': concept, some results without proofs (Shor, Grover) and their security implications. Post-quantum cryptosystems (overview)
 == E-learning process and grading criteria ==