报告时间：2025年6月5日（星期四）14:30-15:30
报告地点：翡翠湖校区科教楼B座1711室
报 告 人：王华雄 教授
工作单位：新加坡南洋理工大学
举办单位：数学学院
报告简介：
Algebra and combinatorics play crucial roles in the field of cryptography. Algebraic structures, such as groups, rings, and fields, form the foundation of many cryptographic algorithms. For example, the RSA encryption algorithm relies on properties of prime numbers and modular arithmetic, both of which are rooted in algebra. Elliptic curve cryptography (ECC) is another application that uses the algebraic structure of elliptic curves over finite fields to create efficient and secure cryptographic schemes. Combinatorics, the study of counting, arrangement, and combination, is essential for analyzing and designing cryptographic protocols. It helps in understanding the complexity and security of these protocols. For instance, combinatorial designs and permutations are used in the construction of block ciphers like the Data Encryption Standard (DES) and Advanced Encryption Standard (AES). The synergy of algebra and combinatorics provides robust tools for developing and analyzing cryptographic systems. In this talk, I will present several concrete examples to illustrate how the interplay between algebra and combinatorics enriches cryptography in the constructions of cryptographic schemes such as secret sharing and secure multiparty computation.
报告人简介：
王华雄于1996年获以色列海法大学数学博士，2021年获澳大利亚卧龙岗大学计算机博士。他是新加坡南洋理工大学数学系教授，并担任2013至2015年数学系主任。目前他也是南洋理工大学的新加坡国家可信数字研究中心联合主任和隐私保护研究中心副主任。他的研究领域包括密码学和网络空间安全。他曾获澳大利亚-新西兰计算机协会颁发的最佳研究奖，担任2020和2021亚密会程序委员会联合主席。