Minimum length key in MST cryptosystems

作     者：Haibo HONG Licheng WANG Haseeb AHMAD Yixian YANG Zhiguo QU 

作者机构：School of Computer Science and Information Engineering Zhejiang Gongshang University Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications Jiangsu Engineering Center of Network MonitoringNanjing University of Information Science & Technology 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2017年第60卷第5期

页      面：142-152页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by National Natural Science Foundation of China (Grant Nos. 61502048, 61370194, 61373131) NSFC A3 Foresight Program (Grant No. 61411146001) supported by PAPD and CICAEET 

主　　题：MLS conjecture finite groups (minimal) logarithmic signature minimum length key MST cryp tosystems 

摘      要：As a special factorization category of finite groups, logarithmic signature(LS) is used as the main component of cryptographic keys that operate within secret key cryptosystems such as PGM and public key cryptosystems like M ST1, M ST2 and M ST3. An LS with the shortest length is called a minimal logarithmic signature(MLS) that constitutes of the smallest sized blocks and offers the lowest complexity, and is therefore desirable for cryptographic constructions. However, the existence of MLSs for finite groups should be firstly taken into an account. The MLS conjecture states that every finite simple group has an MLS. If it holds, then by the consequence of Jordan-H¨older Theorem, every finite group would have an MLS. In fact, many cryptographers and mathematicians are keen for solving this problem. Some effective work has already been done in search of MLSs for finite groups. Recently, we have made some progress towards searching a minimal length key for MST cryptosystems and presented a theoretical proof of MLS conjecture.