A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Linearly shift knapsack public-key cryptosystem
1989
IEEE Journal on Selected Areas in Communications
In this paper, we propose two algorithms to improve the Merkle-Hellman knapsack public-key cryptosystem. First, we propose an approach to transform a superincreasing sequence to a "high density" knapsack sequence. The algorithm is easy to implement and eliminates the redundancy of many knapsack cryptosystems. Second, a linearly shift method is used to improve the security of the knapsack public-key cryptosystem. We show that several knapsacks (e.g., the socalled "useless" knapsack), which
doi:10.1109/49.17717
fatcat:p6n7h7eer5hfpnbbi4aendbwzm