应沙巴足球（中国）股份有限公司官网计算机与信息安全学院、广西密码学与信息安全重点实验室的邀请，斯洛文尼亚普利莫斯卡大学Enes Pasalic教授和Rene Rodrıguez-Aldama博士将于2023年9月19日来校讲学，欢迎全校师生踊跃参加。具体报告安排如下：

时间：2023年9月19日（星期二）下午15:00－17:00

地点：花江校区慧谷一号楼一楼报告厅

报告题目：

Cryptographic (vectorial) Boolean functions and their relation to other combinatorial structures（密码（向量）布尔函数及其与其他组合结构的关系）

主讲人：Enes Pasalic教授

报告摘要：

Cryptographic (vectorial) Boolean functions have many applications in the design of cryptographic algorithms and are commonly related to other discrete structures. In this talk, several well-known classes of such functions will be recalled and their connection to some important discrete combinatorial objects, such as (relative) difference set and Cayley graphs, will be given. In particular, a connection to linear binary (error-correcting) codes will be discussed in more detail. Also, some recent achievements in the theory of bent Boolean functions will be mentioned. The talk will be given on a popular level and the only prerequirement is some elementary linear algebra.

报告题目：

Minimal linear codes: from theory to applications（极小线性码：从理论到应用）

主讲人：Rene Rodrıguez-Aldama

报告摘要：

In this talk, I will present the class of minimal linear codes and I will describe their properties, constructions and applications. Minimal codes are mathematical objects (linear subspaces) that have important applications in our digital world, in particular, they can be used to build secret sharing schemes and two-party computation protocols. In the first part of the talk, I will define these protocols and explain how one can use minimal codes to implement them. In the second part of the talk, I will introduce some constructions of minimal codes using simple mathematical tools and will say a word about more complex constructions using methods taken from algebra, combinatorics and the theory of finite fields. I will also describe a connection between minimal codes and certain cryptographically significant permutations—almost perfect nonlinear permutations (APN).

主讲人简介：

Enes Pasalic received the Ph.D. degree in cryptology from Lund University, Lund, Sweden, in 2003. Since May 2003, he has been doing post-doctoral research at INRIA (Versaille, France) Crypto Group, and later with the Technical University of Denmark, Lyngby, in 2005. He is currently a university professor with FAMNIT \& IAM, University of Primorska, Koper, Slovenia. His main research interests are cryptology and discrete mathematical structures.In particular, the design and analysis of symmetric encryption schemes, coding theory, permutations over finite fields and the theory of Boolean functions

Rene Rodrıguez-Aldama was born in La Piedad, Mexico. He obtained a bachelor’s degree in Physics and Mathematics from the Michoacan University of Saint Nicholas of Hidalgo. Afterwards, he obtained a master’s degree in Pure Mathematics from the National Autonomous University of Mexico with an GPA of 9.9 out of ten. In 2022, he was awarded with a doctoral degree in Mathematics from the University of Primorska, obtaining a perfect GPA. Rene’s main fields of research are cryptography and coding theory. The focus of his research has been on the construction of linear codes and their interactions with other mathematical objects. He has worked in the field of cryptanalysis with a particular emphasis on the search of non-random behaviors of symmetric-key encryption algorithms. Rene has authored four papers published in international peer-reviewed journals, and four more papers that are in the process of publishing. He has presented his results in several international conferences.