Người báo cáo: Hebant Chloé (Université de Limoges)
Thời gian: 14h, Thứ 6 ngày 22 tháng 7 năm 2016
Địa điểm: Phòng 201, Nhà A5, Viện Toán học, 18 Hoàng Quốc Việt.
Tóm tắt:It’s possible to construct a hash function from a function verifying some properties and an iterative scheme. The seminar on Friday 22th July will be in two parts: a presentation of a function corresponding to our problematic; a presentation of an iterative scheme and its evolution. In 1996, Ajtai published an important result: the hardness of the SIS problem relative to worst-case lattice problems. With that, he was able to construct a compression collision-resistant one-way function based on this hardness. Chloé will present this function and will prove those three characteristics presenting the SIS problem and explaining the hardness proof. Then, Chloé will present two iterative schemes to construct hash functions: the Merkle-Damgard construction and its evolution the HAIFA construction. So, we will have seen a complete construction of a hash function. |
