Lecture Title: Some Combinatorial Objects Related to Coding and Cryptography
Lecture Time: 4:00 PM, October 28, 2023
Lecture Venue: Room 106, 1st Floor, Yifu Building, Yucai Campus
Abstract:
In this talk, I will present some recent results on two combinatorial objects related to coding and cryptography. The first one is strong external difference families (SEDF). The study of SEDFs is motivated by algebraic manipulation detection (AMD) codes, which can be regarded as a variation of classical authentication codes; and it has Cryptographic applications. The second topic is on generalized bent functions. It is known that maximum length sequences based on classical bent functions have several applications in spread spectrum techniques. Quite a few generalization on bent functions have been proposed and studied. I will present some results on these two combinatorial objects and the idea behind the study.
Speaker Bio:
Ka Hin Leung is an Associate Professor in the Department of Mathematics at the National University of Singapore (NUS). He is a member of the Singapore Mathematical Society and serves on its committee. He is also an editor of the journal Mathematical Medley. Professor Leung received his undergraduate degree from the University of Hong Kong and his Ph.D. from the University of California, Berkeley. His primary research areas include algebraic combinatorics, design theory, coding theory, preservation problems, and ring theory. He has published over 80 SCI-indexed academic papers, including 19 in the top-tier Journal of Combinatorial Theory, Series A, one in the prestigious IEEE Transactions on Information Theory, and eight in the classic journal Designs, Codes and Cryptography.