A parallel two-list algorithm for the knapsack problem
Parallel Computing
A knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
New cryptosystems design based on hybrid-mode problems
Computers and Electrical Engineering
Quadratic compact knapsack public-key cryptosystem
Computers & Mathematics with Applications
The Multivariate Algorithmic Revolution and Beyond
Improved cryptanalysis of a knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
New attacks for knapsack based cryptosystems
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
| Hi-index | 754.84 |
The Merkle-Hellman cryptosystem is one of the two major public-key cryptosystems proposed so far. It is shown that the basic variant of this cryptosystem, in which the elements of the public key are modular multiples of a superincreasing sequence, is breakable in polynomial time.