Erinevus lehekülje "ITC8240 Cryptography" redaktsioonide vahel

Allikas: Kursused
Mine navigeerimisribale Mine otsikasti
(Lehekülg asendatud tekstiga '== Course information == Code: ITC8240 Cryptography ECTS: 6 Assessment: examination Instructors: * Ahto Buldas ahto dot buldas at ttu dot ee * Aleksandr Lenin ...')
9. rida: 9. rida:
 
Instructors:
 
Instructors:
 
* Ahto Buldas  ahto dot buldas at ttu dot ee
 
* Ahto Buldas  ahto dot buldas at ttu dot ee
−
* Jaan Priisalu jaan dot priisalu at ttu dot ee
 
 
* Aleksandr Lenin aleksandr dot lenin at ttu dot ee
 
* Aleksandr Lenin aleksandr dot lenin at ttu dot ee
−
 
−
== Schedule ==
 
−
 
−
Lecture: Tue 12:00 - 13:30 @U06A-201
 
−
 
−
Exercise:
 
−
  *  Wed 17:45 - 19:15 @SOC-417
 
−
  *  Wed 19:30 - 21:00 @SOC-417
 
−
  *  Fri 14:00 - 15:30 @ICT-A1
 
  
 
== Announcements ==
 
== Announcements ==
−
 
−
06.09.2018 Math test results are available [[Media:TestResults.pdf|here]].
 
−
 
−
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'''.
 
−
 
−
2.1.2019 The exam dates are as follows
 
−
 
−
    1. Jan 4th SOC-311 10:00
 
−
    2. Jan 18th SOC-311 10:00
 
−
 
−
Please register your attendance in the learning environment ÕIS.
 
−
 
−
== 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]].
 

Redaktsioon: 28. august 2019, kell 11:27

Course information

Code: ITC8240 Cryptography

ECTS: 6

Assessment: examination

Instructors:

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

Announcements

Pärit leheküljelt "http://courses.cs.taltech.ee/w/index.php?title=ITC8240_Cryptography&oldid=8451"