Solving low-density subset sum problems
Journal of the ACM (JACM)
On public-key cryptosystems built using polynomial rings
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A New Public-Key Cipher System Based Upon the Diophantine Equations
IEEE Transactions on Computers
Cryptanalysis of a Diophantine Equation Oriented Public Key Cryptosystem
IEEE Transactions on Computers
Non-injective knapsack public-key cryptosystems
Theoretical Computer Science
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Formal analysis of modern security protocols
Information Sciences—Informatics and Computer Science: An International Journal
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
An improved low-density subset sum algorithm
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Adapting density attacks to low-weight knapsacks
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Diophantine approximation attack on a fast public key cryptosystem
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Hiding information and signatures in trapdoor knapsacks
IEEE Transactions on Information Theory
On the security of the Merkle- Hellman cryptographic scheme (Corresp.)
IEEE Transactions on Information Theory
A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
IEEE Transactions on Information Theory
Unconditionally secure cryptosystems based on quantum cryptography
Information Sciences: an International Journal
Secure public-key encryption scheme without random oracles
Information Sciences: an International Journal
Selling multiple secrets to a single buyer
Information Sciences: an International Journal
New cryptosystems design based on hybrid-mode problems
Computers and Electrical Engineering
Broadcast Attacks against Lattice-Based Cryptosystems
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Cryptanalysis of a knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
True random number generator based on mouse movement and chaotic hash function
Information Sciences: an International Journal
Analysis of the efficiency of the Chor-Rivest cryptosystem implementation in a safe-parameter range
Information Sciences: an International Journal
A Novel Combinatorial Public Key Cryptosystem
Informatica
Cryptanalysis of a quadratic compact knapsack public-key cryptosystem
Computers & Mathematics with Applications
Improved cryptanalysis of a knapsack-based probabilistic encryption scheme
Information Sciences: an International Journal
A combination of blind source separation and impulsive chaos synchronisation for encryption
International Journal of Autonomous and Adaptive Communications Systems
| Hi-index | 0.07 |
Knapsack-based cryptosystems had been viewed as the most attractive and the most promising asymmetric cryptographic algorithms for a long time due to their NP-completeness nature and high speed in encryption/decryption. Unfortunately, most of them are broken for the low-density feature of the underlying knapsack problems. In this paper, we investigate a new easy compact knapsack problem and propose a novel knapsack-based probabilistic public-key cryptosystem in which the cipher-text is non-linear with the plaintext. For properly chosen parameters, the underlying knapsack problem enjoys a high density larger than 1.06 in the worst case. Hence, it is secure against the low-density subset-sum attacks. Our scheme can also defeat other potential attacks such as the brute force attacks and the simultaneous Diophantine approximation attack. Compared with previous knapsack-based cryptosystems, our scheme is efficient and practical.