Cryptanalysis of a Cryptosystem with Non- Commutative Platform Groups  

作　　者：Jinhui Liu Jianwei Jia Huanguo Zhang Rongwei Yu Yong Yu Wangqing Wu 

机构地区：[1]College of Computer Science, Shaanxi Normal University, Xi'an, Shanxi, China [2]Computer School of Wuhan University, Wuhan, Hubei, China [3]Key Laboratory of Aerospace Information security and trusted computing Ministry of Education, Wuhan University, Wuhan, Hubei, China [4]School of Computer Science and Technology, Hebei University, Baoding, China

出　　处：《China Communications》2018年第2期67-73,共7页中国通信（英文版）

基　　金：supported by the State Key Program of National Natural Science of China(Grant Nos. 61332019);the National Natural Science Foundation of China (61572303);National Key Research and Development Program of China ( 2017YFB0802003 , 2017YFB0802004);National Cryptography Development Fund during the 13th Five-year Plan Period (MMJJ20170216);the Foundation of State Key Laboratory of Information Security (2017-MS-03);the Fundamental Research Funds for the Central Universities(GK201702004,GK201603084);Major State Basic Research Development Program of China (973 Program) (No.2014CB340600);National High-tech R&D Program of China(2015AA016002, 2015AA016004);Natural Science Foundation of He Bei Province (No. F2017201199);Science and technology research project of Hebei higher education (No. QN2017020)

摘　　要：A cryptosystem with non-commutative platform groups based on conjugator search problem was recently introduced at Neural Computing and Applications 2016. Its versatility was illustrated by building a public-key encryption scheme. We propose an algebraic key-recovery attack in the polynomial computational complexity. Furthermore, we peel off the encryption and decryption process and propose attack methods for solving the conjugator search problem over the given non-abelian group. Finally, we provide corresponding practical attack examples to illustrate the attack methods in our cryptanalysis, and provide some improved suggestions.A cryptosystem with non-commu- tative platform groups based on conjugator search problem was recently introduced at Neural Computing and Applications 2016. Its versatility was illustrated by building a public-key encryption scheme. We propose an algebraic key-recovery attack in the polyno- mial computational complexity. Furthermore, we peel offthe encryption and decryption pro- cess and propose attack methods for solving the conjugator search problem over the given non-abelian group. Finally, we provide corre- sponding practical attack examples to illustrate the attack methods in our cryptanalysis, and provide some improved suggestions.

关 键 词：CRYPTANALYSIS post-quantum com-putational cryptography conjugator searchproblem computational complexity 

分 类 号：TN918.1[电子电信—通信与信息系统]