《信息安全学报》学术沙龙（第十八期）——对称密码学（一）学术报告会

密码是保障信息安全的核心技术和基础支撑，密码算法作为密码学的理论根基，密码算法的安全性是至关重要的关键问题。对称密码的安全性通过评估现有对称密码分析方法下的安全性来保障。国内在密码分析研究方向稳步推进，经过国内科研团队不断的努力，在对称密码的自动化分析等多个方向已经取得了大量国际前沿研究成果。为了更好的推动国内外密码分析技术的交流发展，对密码算法设计理论提供更好的支撑，《信息安全学报》将举办一次对称密码学学术报告会邀请该领域的知名学者展开全方位研讨和交流。

1. 主办方：网络空间安全防御重点实验室、中国科学院信息工程研究所《信息安全学报》

2. 时间：2023年11月22日14：30-15：30

3. 报告线下地点：1号楼106

4. B站直播链接：

报告专家：Eik List

报告题目：Forking sums of permutations for secure and efficient PRFs

摘要:

Co-work with Avijit Dutta and Prof Guo, we provide an organization for the sum of permutations, encrypted davies-meyer, its dual; their variable-output-length extensions, and all their variants from using forking.
Then, we saw gaps in the organization, and proposed schemes to fill the gaps, and an instantiation with round-reduced AES for the two most efficient schemes.

个人简介：

Eik List is a Visiting Researcher at School for Physical and Mathematical Sciences for Nanyang Technological University. His interests are design and cryptanalysis of symmetric ciphers. He served as sub-reviewer for EUROCRYPT, ASIACRYPT and CRYPTO, etc. Over the years, he has published multiple papers at top venues including ASIACRYPT, DCC, etc.

信息安全学报