Skip to main content
SpringerLink
Log in
Book cover

International Conference on Applications and Techniques in Information Security

ATIS 2014: Applications and Techniques in Information Security pp 171–182Cite as

The 0-1 Knapsack Polytope – A Starting Point for Cryptanalysis of Knapsack Ciphers?

  • Conference paper

  • 1525 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 490))

Abstract

The Knapsack Cryptosystem of Merkle and Hellman, 1978, is one of the earliest public-key cryptography schemes. The security of the method relies on the difficulty in solving Subset Sum Problems (also known as Knapsack Problems). In this paper, we first provide a brief history of knapsack-based cryptosystems and their cryptanalysis attacks. Following that, we review the advances in integer programming approaches to 0 − 1 Knapsack Problems, with a focus on the polyhedral studies of the convex hull of the integer set. Last of all, we discuss potential future research directions in applying integer programming in the cryptanalysis of knapsack ciphers.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AbdulHalim, M.F., Attea, B.A., Hameed, S.M.: A binary particle swarm optimization for attacking knapsacks cipher algorithm. In: International Conference on ICCCE 2008, pp. 77–81 (May 2008)

    Google Scholar 

  2. Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361–372 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  3. Adleman, L.M.: On breaking generalized knapsack public key cryptosystems. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC 1983, pp. 402–412. ACM, NY (1983)

    Chapter  Google Scholar 

  4. Al-Dabbagh, R.D.H.: Compact genetic algorithm for cryptanalysis trapdoor 0-1 knapsack cipher. Journal of Al-Nahrain University 12(2), 137–145 (2009)

    Google Scholar 

  5. Balas, E.: Facets of the knapsack polytope. Math. Prog. 8(1), 146–164 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  6. Balas, E., Zemel, E.: Facets of the knapsack polytope from minimal covers. SIAM Journal on Applied Mathematics 34(1), 119–148 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chor, B., Rivest, R.L.: A knapsack type public key cryptosystem based on arithmetic in finite fields. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 54–65. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  8. Desmedt, Y.G.: What happened with knapsack cryptographic schemes? In: Skwirzynski, J.K. (ed.) Performance Limits in Communication Theory and Practice. NATO ASI Series, vol. 142, pp. 113–134. Springer, Netherlands (1988)

    Chapter  Google Scholar 

  9. Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Sequence independent lifting in mixed integer programming. J. Comb. Optim. 4(1), 109–129 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Huang, M., Lee, C., Tzeng, S.: A new knapsack public-key cryptosystem based on permutation combination algorithm (2008), http://isrc.ccs.asia.edu.tw/www/myjournal/P123.pdf

  11. Jain, A., Chaudhari, N.S.: Cryptanalytic results on knapsack cryptosystem using binary particle swarm optimization. In: de la Puerta, J.G., et al. (eds.) International Joint Conference SOCO’14-CISIS’14-ICEUTE’14. AISC, vol. 299, pp. 375–384. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  12. Kaparis, K., Letchford, A.N.: Separation algorithms for 0-1 knapsack polytopes. Math. Prog. 124(1-2), 69–91 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  13. Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. J. ACM 32(1), 229–246 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lenstra Jr., A.K., Lenstra, H.W., Lováz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261(4), 515–534 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lenstra Jr, H.W.: Integer programming and cryptography. The Mathematical Intelligencer 6(3), 14–21 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  16. Liu, A., Wang, J., Han, G., Wang, S., Wen, J.: Improved simulated annealing algorithm solving for 0/1 knapsack problem. In: Proceedings of the 6th ISDA, ISDA 2006, vol. 2, pp. 1159–1164. IEEE Computer Society, DC (2006)

    Google Scholar 

  17. Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press (2010)

    Google Scholar 

  18. Merkle, R.C., Hellman, M.E.: Hiding information and signatures in trapdoor knapsacks. IEEE Transactions on Information Theory 24(5), 525–530 (1978)

    Article  Google Scholar 

  19. Naccache, D., Stern, J.: A new public-key cryptosystem (1997)

    Google Scholar 

  20. Nguyên, P.Q., Stern, J.: Merkle-hellman revisited: A cryptanalysis of the qu-vanstone cryptosystem based on group factorizations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 198–212. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  21. Nguyen, P.Q., Vallée, B.: The LLL Algorithm: Survey and Applications, 1st edn. Springer Publishing Company, Incorporated, Heidelberg (2009)

    Google Scholar 

  22. Odlyzko, A.: Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir’s fast signature scheme. IEEE Trans. Inf. Theor. 30, 594–601 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  23. Qu, M., Vanstone, S.A.: The knapsack problem in cryptography. In: Finite Fields. Contemp Math., vol. 168, pp. 291–308. A.M.S (1994)

    Google Scholar 

  24. Rastaghi, R.: Cryptanalysis of a new knapsack type public-key cryptosystem. CoRR, abs/1210.8375:1–5 (2012)

    Google Scholar 

  25. Ray, A., Bhat, A.: Enhancement of merkle-hellman knapsack cryptosystem by use of discrete logarithmics (2013)

    Google Scholar 

  26. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  27. Schnorr, C.-P., Hörner, H.H.: Attacking the chor-rivest cryptosystem by improved lattice reduction. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 1–12. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  28. Shamir, A.: A polynomial time algorithm for breaking the basic merkle-hellman cryptosystem. In: Advances in Cryptology: Proceedings of CRYPTO 1982, pp. 279–288. Plenum (1982)

    Google Scholar 

  29. Shamir, A.: Embedding cryptographic trapdoors in arbitrary knapsack systems. Information Processing Letters 17(2), 77–79 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  30. Shamir, A., Zippel, R.: On the security of the Merkle–Hellman cryptographic scheme (corresp.). IEEE Trans. Inf. Theor. 26(3), 339–340 (1980)

    Article  MATH  Google Scholar 

  31. Spillman, R.: Cryptanalysis of knapsack ciphers using genetic algorithms. Cryptologia 17(4), 367–377 (1993)

    Article  MATH  Google Scholar 

  32. Van Roy, T.J., Wolsey, L.A.: Solving mixed integer programming problems using automatic reformulation. Operations Research 35(1), 45–57 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  33. Wang, B., Hu, Y.: Quadratic compact knapsack public-key cryptosystem. Computers & Mathematics with Applications 59(1), 194–206 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  34. Weismantel, R.: On the 0/1 knapsack polytope. Math. Prog. 77(3), 49–68 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  35. Wolsey, L.A.: Faces for a linear inequality in 0-1 variables. Math. Prog. 8, 165–178 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  36. Wolsey, L.A.: Integer programming. Wiley-Interscience, NY (1998)

    Google Scholar 

  37. Zemel, E.: Easily computable facets of the knapsack polytope. Mathematics of Operations Research 14(4), 760–764 (1989)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology, Deakin University, Australia

    Vicky H. Mak-Hau & Lynn M. Batten

Authors
  1. Vicky H. Mak-Hau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lynn M. Batten
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technology, Deakin University, Melbourne, Australia

    Lynn Batten

  2. School of Information Technology, Deakin University, Australia

    Gang Li

  3. Institute of Information Engineering, Chinese Academy of Sciences, China

    Wenjia Niu

  4. School of Information and Business Analysis, Melbourne Camput at Burwood, Deakin University, 221, Burwood Highway, 315, Burwood, VIC, Australia

    Matthew Warren

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mak-Hau, V.H., Batten, L.M. (2014). The 0-1 Knapsack Polytope – A Starting Point for Cryptanalysis of Knapsack Ciphers?. In: Batten, L., Li, G., Niu, W., Warren, M. (eds) Applications and Techniques in Information Security. ATIS 2014. Communications in Computer and Information Science, vol 490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45670-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45670-5_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45669-9

  • Online ISBN: 978-3-662-45670-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation