报告地点：行健楼学术活动室665
邀请人：周海燕教授
摘要：In this talk, we study the best security parameters of binary linear complementary pairs (LCPs) of codes. As a result, we solve an open problem proposed by Carlet et al. (IEEE Trans. Inf. Theory 65(3): 1694-1704, 2019) and a conjecture proposed by Choi et al. (Cryptogr. Commun. 15(2): 469-486, 2023).
