报告人:David Gerault
时间:2017年5月5日上午10:00
地点:中国科学院信息工程研究所4号楼4213会议室
摘要:
Evaluating the security of a block cipher is a difficult and time consuming task, so efficient automatic tools are highly desirable. Constraint programming (CP) is a declarative programming paradigm which generalizes other automatic search methods such as MILP or SAT. In this talk, he will present some results obtained using CP for cryptanalysis, in particular to search for related key differential characteristics. He will then introduce the tools that we used to obtain these results and give some examples.