Asymmetric Cryptography Algorithm with Chinese Remainder Theorem
This paper designed a asymmetric algorithm based on Chinese Remainder Theorem and double sequence, which uses the sequence of random numbers generated from the interference of Logistic and Chebychev chaotic mapping to interfere with the backpack sequence, while setting the easy solutions of superincreasing knapsack problem as the limitation of the algorithm, and using Chinese remainder theorem to hide the sequence mentioned above, before making the hidden backpack sequence to be transformed modulus. Through simulation and comparisons with some related algorithms transversely and longitudinally, this algorithm is excellent with a higher efficiency and better security.
Cryptography Public-key Chaotic system Fast
ZHANG Yun-peng LIN Xia WANG Qiang
College of Software and Microelectronics Northwestern Polytechnical University 710072 Xian, China
国际会议
西安
英文
450-454
2011-05-13（万方平台首次上网日期，不代表论文的发表时间）