Subject
Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software
Reference13 articles.
1. Solving a system of linear diophantine equations with lower and upper bounds on the variables;Aardal;Mathematics of Operations Research,2000
2. M.J. Coster, B.A. LaMacchia, A.M. Odlyzko, C.P. Schnorr, An improved low-density subset-sum algorithm, Advances in Cryptology – EUROCRYPT 91, LNCS 547, Springer-Verlag, 1991, pp. 54–67.
3. An Introduction to the Theory of Numbers;Hardy,1979
4. N. Kunihiro, New Definition of Density on Knapsack Cryptosystems, Progress in Cryptology AFRICACRYPT 2008, LNCS 5023, Springer-Verlag, 2008, pp. 156–173.
5. Factoring Polynomials with Rational Coefficients;Lenstra;Mathematische Annalen,1982
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Varying Encryption Scheme: An Innovative Approach to Legacy Data Security;2023 Annual International Conference on Emerging Research Areas: International Conference on Intelligent Systems (AICERA/ICIS);2023-11-16
2. Knapsack Encryption with Elliptic Curve Cryptography Based Secured Wireless Network;2023 2nd International Conference on Edge Computing and Applications (ICECAA);2023-07-19
3. A chaos-based probabilistic block cipher for image encryption;Journal of King Saud University - Computer and Information Sciences;2022-01
4. Chor-Rivest Knapsack Cryptosystem in a Post-quantum World;Advances in Security, Networks, and Internet of Things;2021
5. Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme;Advances in Mathematics of Communications;2018