报告题目：Hash Functions Based On Ramanujan Graphs

报告人：赵鹏博士

报告时间：2019年7月8日9:00-11:00

报告地点：知新楼B座1219报告厅

摘要：In this talk, we present an application of Ramanujan graphs on cryptography, in particular, we investigate how the graphs can be applied to hash functions. We obtain the hash functions based on an explicit construction of an infinite family of Ramanujan hypergraphs, focusing specically on the non-bipartite case. We also propose a generalized concept for expander hypergraph and construct a hash function based on the expander hypergraphs.

赵鹏博士简历：赵鹏博士毕业于山东大学基础数学专业，于俄亥俄州立大学获博士学位，之后在康涅狄格大学，耶鲁和普林斯顿大学等多所高校或研究院从事数论及其相关应用的研究。现在印第安纳州立大学任教。其主要研究兴趣为数论，图论及其在密码学和数据科学上的应用。

邀请人：王明强教授