【摘要】 在对数据进行加密的过程中,由于数据分布随机性强,存在大量的冗余数据,使得数据间存在的关联性较低,传统的加密方法遇到这种低关联性时需要通过逐个数据秘钥的更新完成加密的,如果数据间的距离较大,数据秘钥更新速度很慢,增加计算负担,导致数据加密时间长、效率低的问题。提出基于广义正则半群结构的数据加密方法,分析富足半群的推广的Green关系,通过广义Green关系推广完全正则半群的概念,引入广义正则半群,分析其半格分解。对定义域和值域进行分解,确定固定字长,构建子定义域和子值域之间的映射关系,对标准原文数据进行若干次修正Logistic映射的迭代,完成加密过程。对密文进行若干次修正Logistic逆映射,完成解密。仿真结果表明,所提方法效率高,安全性强,有广泛的应用前景。更多还原

【Abstract】 In the process of data encryption,the data distribution of strong randomness,there are a large number of redundant data,made low,the correlation of data between the traditional encryption methods meet the low affinity needs to be done by each data of secret key updating encrypted,if the data is the distance between the larger,data secret key updating speed is slow,increase the computational burden,cause data encryption a long time,the problem of low efficiency.Based on generalized regular semigroup of the structure of the data encryption methods,analysis of abundant semigroups to promote Green relations,promote the use of the generalized Green relationship completely regular semigroups,the concept of generalized regular semigroups,analyze its a semilattice decomposition.On determination of the fixed domain and the domain decomposition,word length,build the mapping relationship between domain and the domain,the standard of the original data are several modified Logistic mapping iteration,to complete the encryption process.Cipher for several times modified Logistic inverse mapping,complete the decryption.The simulation results show that the proposed method is of high efficiency,strong security,have broad application prospects.更多还原