报告人：Patrick Derbez
时间：2017年5月18日上午9：30
地点：中国科学院信息工程研究所4号楼4213会议室
摘要：First I will present the technique of Demirci and Selçuk as well as the improvements which led to the best known attacks against several block ciphers (eg AES, PRINCE, ...). I will describe an algorithm to automatically search for such attacks against a large class of block ciphers and highlight the main difficulties. Then I will show that a sub-component of the previous algorithm can be used to search for another kind of attacks: impossible differential attacks. Unlike previous algorithm which are only designed to find impossible transitions covering as many rounds as possible, our new algorithm allows us to directly search for the best attacks. Finally, I will discuss open problems on this field.
当前位置：首页 - 新闻动态 - 通知公告
