The study in Knapsack of Public-key System Based on Merkle-Hellman Knapsack System and Rabin Algorithm
Jun Qiao · Shuxue de shijian yu renshi · 2009
Merkle-Hellman Knapsack System is based on the superincreasing backpack problem.It makes the process of encryption and decryption relatively simple. However,because of the weaknesses of the system itself,many domestic and foreign scholars have proposed cracking programmes.In this paper,we proposed a new idea of combining Rabin Algorithm based on Merkle-Hellman Knapsack System which can make the original system more flexible.The improved algorithm is not only highly efficient,but also makes it to be true that people can change the value of the public key dynamically according to their needs to exponential increase security.