A New Secure Encryption Scheme Based on Group Factorization Problem
Cong Yue, Haibo Hong, Jun Shao, Song Hwa Han, Jianhong Lin, Shuai Zhao · IEEE Access · 2019
As special types of factorization of finite groups, logarithmic signatures and covers have been used as the main components of cryptographic keys for secret key cryptosystems such as$PGM$and public key cryptosystems like$MST_{1}$,$MST_{2}$,$MST_{3}$and$eMST_{3}$. In particular, as a natural analogue of integer factorization problem (IFP), group factorization problem (GFP) and its hardness assumption over certain factorization basis, referred as logarithmic signature, play a core role in the security arguments for the family of$MST$cryptosystems. Security is not the unique goal of designing a cryptosystem. Instead, efficiency is also a major issue. In this paper, we design a new secure encryption scheme based on group factorization problem (GFP). Furthermore, we present the security analysis and demonstrate the performance of our scheme. Comparing with$eMST_{3}$, our scheme is simplified with more efficiency.