 |
|
|
|
|
|
| Yaniv's Office Hours | Hi.
I'm deeply sorry, but because of last minute personal reasons I missed my office hours today.
I will give office hours tomorrow (Wednesday) at 12:00 instead.
You can also contact me by e-mail.
Yaniv.
|
|
| تم النشر ب- 16/3/2010, 17:38:33 |
|
|
|
|
|
|
|
|
|
|
|
|
| Moed B | Moed B exam will be on Thursday, 18/03, 14:30 in Taub 5.
You may bring to the exam any written (i.e., on paper) material.
Office hours before the exam -
Yaniv - Tuesday, 16/3, 14:00.
Gadi - Wednesday, 17/03, 14:30.
Good luck,
Gadi and Yaniv. |
|
| تم النشر ب- 14/3/2010, 21:37:30 |
|
|
|
|
|
|
|
|
|
|
|
|
| Colloquium: Electronic Voting and Cryptography | On Tuesday Dr. Tal Moran from Harvard university will give a talk in our department on electronic voting and cryptography.
You may find this talk interesting.
More details can be found here: http://www.cs.technion.ac.il/~colloq/20100216_14_30_Moran.html
Regards,
The course team. |
|
| تم النشر ب- 14/2/2010, 23:31:01 |
|
|
|
|
|
|
|
|
|
|
|
|
| Moed A Grades | Moed A grades are published, and so are the final grades.
Appeals may be submitted until Monday, 22/02/2010. No appeals will be accepted after this date.
To submit an appeal, email it to Yaniv. Write your appeal as a Word or PDF document and attach it to the email. You do not need to attach the scanned exam. Hand-written appeals will not be accepted.
The appeal must include the correct answers for the questions you appeal on.
Good luck,
Gadi and Yaniv. |
|
| تم النشر ب- 14/2/2010, 21:14:31 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework 6 Graded | Homework 6 was graded and will be returned to the cells tomorrow.
The grades are available online.
Question 2 was not checked, and all students who submitted it got full grade for it.
A comment about question 3:
Most of you explained the security of your secret-sharing constructions by very inaccurate hand waving, or incomplete arguments (for instance, claiming that XORing all the values does not reveal the secret -- does not prove that perfoeming other manipulations will not reveal the secret).
Despite the inaccuracies, we generally accepted most explanations.
However, note that the correct way to prove that a group of parties cannot reconstruct the secret S, is to prove that given the information they have any value of the secret is possible, and is equally probable.
Good luck! |
|
| تم النشر ب- 4/2/2010, 02:07:27 |
|
|
|
|
|
|
|
|
|
|
|
|
| Moed A Exam | The Moed A exam will be held on Monday 8/2/2010, 13:00-16:00, Taub 7.
You may bring to the exam any written (i.e., on paper) material.
Office hours before the exam -
Gadi - Thursday, 4/2, 15:30.
Yaniv - Sunday, 7/2, 15:00.
Good luck. |
|
| تم النشر ب- 1/2/2010, 16:35:03 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework 5 checked | | Homework 5 was checked and will be returned to the cells soon. The grades are available online. |
|
| تم النشر ب- 28/1/2010, 10:02:37 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework 4 checked | | Homework 4 was checked and will be returned to the cells tomorrow. The grades are available online. |
|
| تم النشر ب- 25/1/2010, 16:21:08 |
|
|
|
|
|
|
|
|
|
|
|
|
| Advanced Topics in Cryptology and Project in Computer Security | As was announced in class, next semester an advanced course in cryptology will be offered.
The course 236613 will be taught on Tuesdays, 8:30-10:30, by Prof. Biham.
The course website is: http://webcourse.cs.technion.ac.il/236613/
You can take a look at the site of the previous semester to get a general idea about the material that will be covered (but note that the covered material will not be identical to that of the previous semester).
Also, you may be interested in some projects in computer security that will be offered next semester.
The project in computer security course (236349) in the Spring semester will include the following the topics:
1. Security in databases and web.
2. Malware detection, Botnet detection, and distributed security.
3. Covert channels.
4. Obfuscation.
More information can be found at: http://webcourse.cs.technion.ac.il/236349/
Regards,
The course staff. |
|
| تم النشر ب- 24/1/2010, 14:16:22 |
|
|
|
|
|
|
|
|
|
|
|
|
| HW 6 | The sixth (and final!) assignment is now available on the course website.
The material for questions 1-2 will be taught at the next lecture (this Monday).
Good luck. |
|
| تمت الحتلنة الأخيرة ب- 7/1/2010, 19:08:35 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework 3 checked | | Homework 3 was checked and will be returned to the cells on Sunday. The grades are available online. |
|
| تم النشر ب- 31/12/2009, 17:26:41 |
|
|
|
|
|
|
|
|
|
|
|
|
| HW 5 | The fifth assignment is now available in the course website.
The material for the 3rd question will be taught at the next lecture (this Monday).
Good luck! |
|
| تمت الحتلنة الأخيرة ب- 25/12/2009, 01:49:17 |
|
|
|
|
|
|
|
|
|
|
|
|
| Yet another clarification conerning question 2 | | You can assume n=pq with p,q primes (as in RSA). |
|
| تم النشر ب- 22/12/2009, 22:31:49 |
|
|
|
|
|
|
|
|
|
|
|
|
| HW4 question 2 hint, and HW6 clarification | As many students got stuck in this question, here is a hint for the direction in which given that the function is a permutation you need to show that the gcd is 1: Assume by contradiction that the gcd is greater than 1. Note that it implies, without loss of generality, that gcd(e,p-1) is greater than 1. Now try to solve the question in the group Z^*_p, and think on how to apply this result to the original Z^*_n.
Also, in question 6d, we can assume that all the intermediate chaining values (outputs of the compression function) are given, there in no need to count the applications of the compression function to the original message when analyzing the complexity. |
|
| تمت الحتلنة الأخيرة ب- 22/12/2009, 21:43:16 |
|
|
|
|
|
|
|
|
|
|
|
|
| Course slides updated | Please note we updated the slides on the website.
Namely, we added slides for the Mutual Commitment and Contract Signing lectures, and for the Zero-Knowledge Proofs tutorial.
|
|
| تم النشر ب- 20/12/2009, 20:37:24 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework 2 checked | | Homework 2 was checked and will be returned to the cells soon. The grades are available online. |
|
| تم النشر ب- 20/12/2009, 11:35:45 |
|
|
|
|
|
|
|
|
|
|
|
|
| HW4 was updated | | In question 6, the additional assumption about the padding and message length was removed from parts d and e. |
|
| تم النشر ب- 14/12/2009, 10:08:53 |
|
|
|
|
|
|
|
|
|
|
|
|
| HW 4 - clarification | In question 4 (Rabin cryptosystem):
1) In saif a you can assume p and q are known.
2) In saif b you can assume that c is chosen by the attacker, but b is constant. |
|
| تم النشر ب- 9/12/2009, 16:12:31 |
|
|
|
|
|
|
|
|
|
|
|
|
| HW 4 | The fourth assignment is now available in the course website.
Note that this assignment has weight of 1.5 assignments.
Good luck! |
|
| تم النشر ب- 1/12/2009, 19:07:42 |
|
|
|
|
|
|
|
|
|
|
|
|
| HW 3 submission is postponed | | You can submit HW 3 until Thursday, 3/12/09. |
|
| تم النشر ب- 29/11/2009, 15:24:51 |
|
|
|
|
|
|
|
|
|
|
|
|
| HW 3 | The third assignment is now available in the course website.
Good luck! |
|
| تم النشر ب- 17/11/2009, 17:43:51 |
|
|
|
|
|
|
|
|
|
|
|
|
| HW 2 | The second assignment is now available in the course website.
Good luck! |
|
| تمت الحتلنة الأخيرة ب- 4/11/2009, 08:27:33 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework 1 checked | | Homework 1 was checked and will be returned to the cells tomorrow. The grades are available online. |
|
| تم النشر ب- 2/11/2009, 18:29:36 |
|
|
|
|
|
|
|
|
|
|
|
|
| HW 1 | Welcome to the Modern Cryptology course!
Good news: The first assignment is now available on the course website!
Good luck.
|
|
| تمت الحتلنة الأخيرة ب- 19/10/2009, 18:26:16 |
|
|
|
|
|
|
ألتخنيون - معهد تكنولوجي لإسرائيل 
