Erinevus lehekülje "ITC8240 Cryptography" redaktsioonide vahel

Allikas: Kursused
Mine navigeerimisribale Mine otsikasti
 
(ei näidata 2 kasutaja 153 vahepealset redaktsiooni)
7. rida: 7. rida:
 
Assessment: examination
 
Assessment: examination
  
Instructors:
+
'''Lecturers/Instructors''':
* Ahto Buldas  ahto dot buldas at ttu dot ee
+
* '''Ahto Buldas''' ahto dot buldas at taltech dot ee
* Jaan Priisalu jaan dot priisalu at ttu dot ee
+
* '''Aleksandr Lenin''' aleksandr dot lenin at taltech dot ee
* Aleksandr Lenin aleksandr dot lenin at ttu dot ee
 
  
== Schedule ==
+
'''Announcements'''
 +
* Mathematics test results: [[Media:MathTestResults_2020_Fall.pdf|MathTestResults_2020_Fall.pdf]].
  
Lecture: Tue 12:00 - 13:30 @U06A-201
+
'''Lectures''': Every Thursday 16:15-17:45 in ICO-316 or remotely, as listed below:
 +
* '''Sep 3: ICO-316'''. Introduction # [[Media:TC8240-Introduction to the course.pdf | Introduction to the course.pdf]]
 +
* '''Sep 10: Remotely'''. Simple ciphers and attacks # [[Media:TC8240-Simple-Ciphers-and-Attacks.pdf | Simple ciphers and attacks.pdf]] # [[Media:TC8240-Elementary-Number-Theory.pdf | Elementary number theory.pdf]]
 +
* '''Sep 17: Remotely'''. Attacks against classical ciphers # [[Media:TC8240-breaking-imperfect-ciphers.pdf | Attacks against classical ciphers.pdf]]
 +
* '''Sep 24: Remotely'''. Attacks against classical ciphers.
 +
* '''Oct 1: Remotely'''. Theory of unbreakable ciphers. # [[Media:TC8240-unbreakable-ciphers.pdf | unbreakable-ciphers.pdf]]
 +
* '''Oct 8: Remotely'''. Theory of unbreakable ciphers (continues).
 +
* '''Oct 15: Remotely'''. Key Establishment.
 +
* '''Oct 22: Remotely'''. Limited Adversaries I.
 +
* '''Oct 29: Remotely'''. Limited Adversaries II.
 +
* '''Nov 5:  Remotely'''  RSA Cryptosystem.
 +
* '''Nov 12: Remotely''' RSA Cryptosystem II. Slides and lecture video available in Moodle.
 +
* '''Nov 19:  Remotely''' RSA Implementation Failures. Slides available in Moodle. Lecture video available in Moodle. 
 +
* '''Nov 26: Non-interactive mode''' Signatures and Hash Functions. Slides available in Moodle. Lecture video will be available in Moodle by Monday Dec 7.
 +
* '''Dec 3:  Non-interactive mode''' Signatures and Hash Functions. Slides available in Moodle. Lecture video will be available in Moodle by Monday Dec 7.
 +
* '''Dec 10: Non-interactive mode''' Identification and Zero Knowledge. Slides and lecture video will be available in Moodle by Monday Dec 14.
 +
* '''Dec 17: Non-interactive mode''' Quantum Computation and Post-Quantum Cryptography. Slides and lecture video will be available in Moodle by Monday Dec 14.
  
Exercise:  
+
'''Tests during examination session''': Every student gets a possibility to improve his/her test result on January 7 and January 14.
  * Wed 17:45 - 19:15 @SOC-417
+
* '''January 7''': 09:00 - 14:00 EST
  * Wed 19:30 - 21:00 @SOC-417
+
* '''January 14''': 09:00 - 14:00 EST
  *  Fri 14:00 - 15:30 @ICT-A1
+
You will see a new section in the bottom of the course page containing the tests. The tests will be released for public access at 09:00 EST and the submissions will be accepted until 14:00 EST.
 +
Both tests, test1 and test2 will be published simultaneously. The students have a possibility to re-take test1, test2, or both.
  
== Announcements ==
+
'''Course materials''':
 
+
* Moodle page: https://moodle.taltech.ee/course/view.php?id=30639
06.09.2018 Math test results are available [[Media:TestResults.pdf|here]].
+
* Student enrollment key: ITC8240_2020_FALL
 
 
19.10.2018 Practice lessons on November 7th (IVCM 11,12) and 9th (IAPM 11,12) are '''cancelled'''.
 
 
 
19.12.2018 The semester is practically over, and there no topics for us to discuss during the practice session. No new topics will come in this course. For this reason, the practice sessions today (19.12.2018) and 21.12.2018 are '''cancelled'''.
 
 
 
== Lectures ==
 
 
 
1. [[Media:ITC8240-Simple-Ciphers-and-Attacks.pdf|Simple Ciphers and Attacks]] and [[Media:ITC8240-Numbertheory.pdf|Elementary Number Theory]]
 
 
 
2. [[Media:ITC8240-Applicationproblems.pdf|Application Problems]] and [[Media:ITC8240-Protocolissues.pdf|Protocol Issues]]
 
 
 
3. [[Media:ITC8240-Unbreakable-ciphers.pdf|Theory of Unbreakable Ciphers]]
 
 
 
4. [[Media:ITC8240-Breaking-imperfect-ciphers.pdf|Breaking Imperfect Ciphers]]
 
 
 
5. [[Media:ITC8240+DiffieHellman-Dh.pdf| Key Establishment]]
 
 
 
== Exercises ==
 
 
 
=== Weeks 2,3: Modular Projection ===
 
* [[Media:ITC8240_Mod_Exercises.pdf|Exercises]] and [[Media:ITC8240_ModularProjection_Solution.pdf|Solution]]
 
* Proofs of relevant [[Media:ITC8240_ModularProjection_Theorems.pdf|theorems]].
 
 
 
=== Week 4: Theory of Unbreakable Ciphers ===
 
 
 
* [[Media:ITC8240-Notes-Probability-Theory.pdf|Theory of Probability (notes)]]
 
* [[Media:ITC8240-Probabilistic-Cipher-Model-Notes.pdf|Probabilistic Cipher Model (notes)]]
 
 
 
=== Weeks 5,6: Breaking historical ciphers ===
 
 
 
* Exercises [[Media:ITC8240_Historic_Ciphers_Exercises.pdf|part1]] and [[Media:ITC8240-Breaking-Historical-Ciphers-Exercise-Solution-1.pdf|Solution]]
 
* Exercises [[Media:ITC8240-Breaking-Historical-Ciphers-Exercises2.pdf|part2]] and [[Media:ITC8240-Breaking-Historical-Ciphers-Solution2.pdf|Solution]]
 
 
 
=== Week 7: Key establishment protocols ===
 
 
 
* [[Media:ITC8240-Hw1.pdf|Homework]] Due date: Mon, Nov 5th
 
* [[Media:ITC8240-Key-Establishment-Protocols-Exercises.pdf|Exercises]] and [[Media:ITC8240-Complexity-Combinatorics-Solution.pdf|Solution]]. The 3SAT model of graph 3-colorability can be seen here [[Media:ITC8240-3sat.txt|3sat]].
 
 
 
=== Week 8: Groups ===
 
 
 
* [[Media:ITC8190_Groups_Exercises.pdf|Exercises]] and [[Media:ITC8240-Groups-Solution.pdf|Solution]]
 
 
 
=== Week 9: RSA, Chinese Remainder Theorem ===
 
 
 
* [[Media:ITC8240-Theory-Crt.pdf|Chinese Remainder Theorem (theory)]]
 
* [[Media:ITC8240-CRT-Exercises.pdf|Exercises]] and [[Media:ITC8240-CRT-Solution.pdf|Solution]]
 
 
 
=== Week 10: First written test ===
 
 
 
* [[Media:ITC8249-Topics-of-test.pdf|List of topics to prepare for the test]]
 
 
 
=== Week 11: Primality Testing, CRT, RSA weaknesses ===
 
 
 
* [[Media:ITC8240-PrimalityTesting-Exercises.pdf|Exercises]] and [[Media:ITC8240-PrimalityTestingAndRSA-Solution.pdf|Solution]]
 
 
 
=== Week 12: Strong primality tests ===
 
 
 
* [[Media:ITC8240-MillerRabin-Exercises.pdf|Exercises]] and [[Media:ITC8240-MillerRabin-Solution.pdf|Solution]]
 
 
 
=== Week 13: Factoring and plain RSA insecurity (again) ===
 
 
 
* [[Media:ITC8240-Factoring-Exercises.pdf|Exercises]] and [[Media:ITC8240-Factoring-Solution.pdf|Solution]]
 
 
 
=== Week 14: RSA-CRT fault attacks, DDH assumption ===
 
 
 
* [[Media:ITC8240-RSA-CRT-DDH-Solution.pdf|Solution]]
 
 
 
=== Week 15: Topics for the test ===
 
 
 
Test time and place: Tue 12:00 - 13:30 @U06A-201
 
 
 
 
 
    1. Modular exponential function: finding primitive elements in simple cases
 
    2. Diffie-Hellman key establishment
 
    3. Man in the middle attack against Diffie-Hellman key establishment
 
    4. O- and o- notations
 
    5. The notion of S-security and security bits
 
    6. RSA setup: given prime numbers, find suitable public and private exponents
 
    7. RSA setup: given a public exponent, find suitable prime numbers or determine
 
      if given primes are ok for RSA
 
    8. Probabilistic prime number tests: given the required reliablility of the test,
 
      compute the number of trials
 
    9. Common modulus RSA: how to reconstruct the message if the same message is sent
 
      to two users in encrypted form
 
    10. Chinese reminder theorem
 
    11. Finding square roots of 1
 
    12. Factoring with square roots of 1
 
    13. Small public exponent attack against pure RSA
 
    14. Blind signatures and Chaum’s digital cash
 
    15. Homomorphic property of RSA and related weaknesses
 
 
 
The write-up is available here: [[Media:ITC8240-Test-Preparation.pdf|writeup]].
 

Viimane redaktsioon: 24. detsember 2020, kell 13:27

Course information

Code: ITC8240 Cryptography

ECTS: 6

Assessment: examination

Lecturers/Instructors:

  • Ahto Buldas ahto dot buldas at taltech dot ee
  • Aleksandr Lenin aleksandr dot lenin at taltech dot ee

Announcements

Lectures: Every Thursday 16:15-17:45 in ICO-316 or remotely, as listed below:

  • Sep 3: ICO-316. Introduction # Introduction to the course.pdf
  • Sep 10: Remotely. Simple ciphers and attacks # Simple ciphers and attacks.pdf # Elementary number theory.pdf
  • Sep 17: Remotely. Attacks against classical ciphers # Attacks against classical ciphers.pdf
  • Sep 24: Remotely. Attacks against classical ciphers.
  • Oct 1: Remotely. Theory of unbreakable ciphers. # unbreakable-ciphers.pdf
  • Oct 8: Remotely. Theory of unbreakable ciphers (continues).
  • Oct 15: Remotely. Key Establishment.
  • Oct 22: Remotely. Limited Adversaries I.
  • Oct 29: Remotely. Limited Adversaries II.
  • Nov 5: Remotely RSA Cryptosystem.
  • Nov 12: Remotely RSA Cryptosystem II. Slides and lecture video available in Moodle.
  • Nov 19: Remotely RSA Implementation Failures. Slides available in Moodle. Lecture video available in Moodle.
  • Nov 26: Non-interactive mode Signatures and Hash Functions. Slides available in Moodle. Lecture video will be available in Moodle by Monday Dec 7.
  • Dec 3: Non-interactive mode Signatures and Hash Functions. Slides available in Moodle. Lecture video will be available in Moodle by Monday Dec 7.
  • Dec 10: Non-interactive mode Identification and Zero Knowledge. Slides and lecture video will be available in Moodle by Monday Dec 14.
  • Dec 17: Non-interactive mode Quantum Computation and Post-Quantum Cryptography. Slides and lecture video will be available in Moodle by Monday Dec 14.

Tests during examination session: Every student gets a possibility to improve his/her test result on January 7 and January 14.

  • January 7: 09:00 - 14:00 EST
  • January 14: 09:00 - 14:00 EST

You will see a new section in the bottom of the course page containing the tests. The tests will be released for public access at 09:00 EST and the submissions will be accepted until 14:00 EST. Both tests, test1 and test2 will be published simultaneously. The students have a possibility to re-take test1, test2, or both.

Course materials: