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 super-increasing 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.