A parallel two-list algorithm for the knapsack problem
Parallel Computing
Secure communications over insecure channels
Communications of the ACM
Some Open Problems In Cryptography
ACM '78 Proceedings of the 1978 annual conference
A knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
New cryptosystems design based on hybrid-mode problems
Computers and Electrical Engineering
Cryptanalysis of a knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
Quadratic compact knapsack public-key cryptosystem
Computers & Mathematics with Applications
Cryptanalysis of a quadratic knapsack cryptosystem
Computers & Mathematics with Applications
A public key cryptosystem based on three new provable problems
Theoretical Computer Science
Research note: ID-based group-oriented cryptosystem and its digital signature scheme
Computer Communications
The Multivariate Algorithmic Revolution and Beyond
Greedy continuous particle swarm optimisation algorithm for the knapsack problems
International Journal of Computer Applications in Technology
Faster algorithm for solving hard knapsacks for moderate message length
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Fundamenta Informaticae
Proceedings of the Fifth International Conference on Security of Information and Networks
Improved cryptanalysis of a knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
Full lattice basis reduction on graphics cards
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
New attacks for knapsack based cryptosystems
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Implicit polynomial recovery and cryptanalysis of a combinatorial key cryptosystem
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
A new elliptic curve cryptosystem for securing sensitive data applications
International Journal of Electronic Security and Digital Forensics
Information protection systems based on universal knapsack problem
Proceedings of the 6th International Conference on Security of Information and Networks
Hi-index | 754.85 |
The knapsack problem is an NP-complete combinatorial problem that is strongly believed to be computationally difficult to solve in general. Specific instances of this problem that appear very difficult to solve unless one possesses "trapdoor information" used in the design of the problem are demonstrated. Because only the designer can easily solve problems, others can send him information hidden in the solution to the problems without fear that an eavesdropper will be able to extract the information. This approach differs from usual cryptographic systems in that a secret key is not needed. Conversely, only the designer can generate signatures for messages, but anyone can easily check their authenticity.