報告時間：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年獲以色列海法大學數學博士，2001年獲澳大利亞臥龍崗大學計算機博士。他是新加坡南洋理工大學數學系教授，并擔任2013至2015年數學系主任。目前他也是南洋理工大學的新加坡國家可信數字研究中心聯合主任和隱私保護研究中心副主任。他的研究領域包括密碼學和網絡空間安全。他曾獲澳大利亞-新西蘭計算機協會頒發的最佳研究獎，擔任2020和2021亞密會程序委員會聯合主席。
