1 |
A. Yasinsac, "Cryptography: Public Key Algorithm Cryptography based on the Knapsack Problem," University of South Alabama, 2008.
|
2 |
C. Christensen, "Cryptology: The Knapsack Problem," Department of Mathematics Northern Kentucky University, 2005.
|
3 |
S. K. Chong, G. Farr, L. Frost, and S. Hawley, "On Pedagogically Sound Examples in Public-key Cryptography," Conferences in Research and Practice in Information Technology, Vol. 48, No. 1, pp. 63-68, Australian Computer Society Inc., Jan. 2006.
|
4 |
G. Fee, "Math 342: Elementary Number Theory," Department of Mathematics and Statistics, SFU, 2000.
|
5 |
J. Bakker, "The Knapsack Problem and The LLL Algorithm," http://www.math.ucsd.edu/~crypto/Projects/JenniferBakker/Math187/index.html, 2004.
|
6 |
B. Pope. "Cryptography Again: Algorithmic Problem Solving," CSSE, The University of Melbourne, 2008.
|
7 |
K. Scott, "CS 413, Computer and Data Security: The Knapsack Problem and Merkle Hellman Encryption,", 2007.
|
8 |
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms," McGrew-Hill Book Company, 2005.
|
9 |
Wikipedia, "List of Knapsack Problems," http://en.wikipedia.org/wiki/List_of_knapsack_problems, Wikimedia Foundation Inc., 2012.
|
10 |
B. Ho, "Further Exploration in Public Key Encryption," The MIT Undergraduate Journal of Mathematics, 2000.
|
11 |
J. C. Gao and E. R. Zhou, "Introduction to Knapsack Cipher," http://zhouer.org/courses/2003-IIS/slide.pdf, 2003.
|
12 |
R. C. Merkel and M. E. Hellman, "Hiding Information and Signatures in Trapdoor Knapsacks," IEEE Trans. on Information Theory, Vol. 24, No. 5, pp. 523-530, Sep. 1978, https://doi.org/10.1109/TIT.1978.1055927
DOI
|
13 |
D. Nacin, "The Subset-Sum Problem," Department of Mathematics, William Paterson University, 2008.
|
14 |
C. Blair, "Notes on Cryptography," Business Administration Dept., University of Illinois, 1994.
|
15 |
C. Umans, "CS21: Decidability and Tractability," Computer Science, California Institute of Technology, 2008.
|
16 |
G. J. Woeginger, "CO2a: Combinatorial Optimization - Open Problems Around Exact Algorithms," Department of Mathematics and Computer Science, TU Eindhoven, 2008.
|
17 |
Wikipedia, "NP-Complete," http://en.wikipedia.org/wiki/NP-Complete, Wikimedia Foundation Inc., Retrieved Jan. 2022.
|
18 |
R. J. W. James and R. H. Storer, "Techniques for Solving Subset Sum Problems within a Given Tolerance," International Trans. in Operational Research, Vol. 12, No. 4, pp. 437-453, Jul. 2005, https://doi.org/10.1111/j.1475-3995.2005.00517.x
DOI
|
19 |
F. R. Dogar, L. Aslam, Z. A. Uzmi, S. Abbasi, and Y. C. Kim, "Connection Preemption in Multi-Class Networks," IEEE Globecom, 2006.
|
20 |
A. Moffat, "Example for the book "Programming, Problem Solving, and Abstraction with C," Pearson Sprint Print, Sydney, Australia, 2003.
|