{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T18:02:57Z","timestamp":1748455377717},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T00:00:00Z","timestamp":1550102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s11036-019-01216-8","type":"journal-article","created":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T04:40:03Z","timestamp":1550119203000},"page":"211-222","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Cryptanalysis of Merkle-Hellman Cipher Using Parallel Genetic Algorithm"],"prefix":"10.1007","volume":"25","author":[{"given":"Nedjmeddine","family":"Kantour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadek","family":"Bouroubi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"issue":"5","key":"1216_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"M Hellman","year":"1978","unstructured":"Hellman M, Merkle R (1978) Hiding information and signatures in trapdoor knapsacks. IEEE Trans Inf Theory 24(5):525\u2013530","journal-title":"IEEE Trans Inf Theory"},{"key":"1216_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Richard M. Karp","year":"1972","unstructured":"Karp R (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85\u2013103"},{"key":"1216_CR3","volume-title":"Genetic algorithms - principles and perspectives: a guide to GA theory","author":"CR Reeves","year":"2003","unstructured":"Reeves CR, Rowe JE (2003) Genetic algorithms - principles and perspectives: a guide to GA theory. Kluwer Academic Publishers, Dordrech"},{"issue":"5","key":"1216_CR4","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TIT.1984.1056964","volume":"IT-30","author":"A Shamir","year":"1984","unstructured":"Shamir A (1984) A polynomial time algorithm for breaking the basic Merkle Hellman cryptosystem. IEEE Trans Inf Theory IT-30(5):699\u2013704","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"1216_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1080\/0161-119391867999","volume":"17","author":"R Spillman","year":"1993","unstructured":"Spillman R (1993) Cryptanalysis of knapsack ciphers using genetic algorithms. Cryptologia 17(4):367\u2013377","journal-title":"Cryptologia"},{"key":"1216_CR6","doi-asserted-by":"crossref","unstructured":"Lenstra AK, Lenstra HW Jr~, Lov\u00e1sz L (1982) Factoring polynomials with rational coefficients. Math Ann, pp 515\u2013534","DOI":"10.1007\/BF01457454"},{"key":"1216_CR7","doi-asserted-by":"crossref","unstructured":"Sinha S, Palit S, Molla M, Khanra A, Kule M (2011) A cryptanalytic attack on knapsack cipher using differential evolution algorithm, recent advances in intelligent computational systems (RAICS), IEEE","DOI":"10.1109\/ICCCT.2011.6075143"},{"key":"1216_CR8","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading"},{"key":"1216_CR9","volume-title":"An introduction to genetic algorithms","author":"M Melanie","year":"1996","unstructured":"Melanie M (1996) An introduction to genetic algorithms. MIT Press, Cambridge"},{"key":"1216_CR10","volume-title":"Adaption in natural and artificial systems, ann arbor MI","author":"J Holland","year":"1975","unstructured":"Holland J (1975) Adaption in natural and artificial systems, ann arbor MI. The University of Michigan Press, Michigan"},{"key":"1216_CR11","volume-title":"Introduction to genetic algorithms","author":"SN Sivanandam","year":"2008","unstructured":"Sivanandam SN, Deepa SN (2008) Introduction to genetic algorithms. Springer, Berlin"},{"key":"1216_CR12","doi-asserted-by":"crossref","unstructured":"Stamp M (2005) Information security: principles and practice. Wiley-Interscience","DOI":"10.1002\/0471744190"},{"key":"1216_CR13","volume-title":"Introduction to cryptography with open-source software","author":"A McAndrew","year":"2011","unstructured":"McAndrew A (2011) Introduction to cryptography with open-source software. CRC Press, Boca Raton, Florida, USA"},{"key":"1216_CR14","volume-title":"Combinatorial Algorithms: generation, enumeration and search","author":"DL Kreher","year":"1999","unstructured":"Kreher DL, Stinson DR (1999) Combinatorial Algorithms: generation, enumeration and search. CRC Press, Boca Raton, Florida, USA"},{"issue":"1","key":"1216_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"JC Lagrias","year":"1985","unstructured":"Lagrias JC, Odlyzko AM (1985) Solving low-density subset problems. J ACM (JACM) 32(1):229\u2013246","journal-title":"J ACM (JACM)"},{"key":"1216_CR16","doi-asserted-by":"crossref","unstructured":"Coster MJ, Joux A, LaMacchia BA, Odlyzko AM, Schnorr C, Stern J (1992) An improved low-density subset sum algorithm. Computational Complexity, 2","DOI":"10.1007\/BF01201999"},{"key":"1216_CR17","doi-asserted-by":"crossref","unstructured":"Adleman LM (1983) On beaking generalized knapsack public key cryptosystems. In: ACM Proceedings of 15th STOC","DOI":"10.1145\/800061.808771"},{"key":"1216_CR18","unstructured":"Stein W et al (2009) Sage mathematics software (Version 4.2.1). The sage development team 14th. \nhttp:\/\/www.sagemath.org"},{"key":"1216_CR19","doi-asserted-by":"crossref","unstructured":"Palit S, Sinha S, Molla M, Khanra A, Kule M (2011) A cryptanalytic attack on the knapsack cryptosystem using binary firefly algorithm. In: 2nd international conference on computer and communication technology (ICCCT). IEEE, pp 428\u2013432","DOI":"10.1109\/ICCCT.2011.6075143"},{"issue":"9","key":"1216_CR20","first-page":"8295","volume":"16","author":"T Mandal","year":"2016","unstructured":"Mandal T, Kule M (2016) An improved cryptanalysis technique based on Tabu search for Knapsack cryptosystem. Int J Control Theory Appl 16(9):8295\u20138302","journal-title":"Int J Control Theory Appl"},{"issue":"12","key":"1216_CR21","first-page":"4071","volume":"1","author":"P Garg","year":"2007","unstructured":"Garg P, Shastri A, Agarwal DC (2007) An enhanced cryptanalytic attack on Knapsack Cipher using genetic algorithm. World academy of science, engineering and technology, international science index 12. Int J Comput Electrical Automation Control Inf Eng 1(12):4071\u20134074","journal-title":"Int J Comput Electrical Automation Control Inf Eng"},{"key":"1216_CR22","unstructured":"Jain A, Chaudhari NS (2014). In: de la Puerta J et al (eds) International joint conference SOCO14-CISIS14-ICEUTE14 advances in intelligent systems and computing, vol 299. Springer, Cham"},{"issue":"4","key":"1216_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11036-018-1005-3","volume":"23","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, El-Shahat D, El-henawy I, Sangaiah AK, Ahmed SH (2018) A novel whale optimization algorithm forcryptanalysis in Merkle-Hellman cryptosystem. Mobile Netw Appl 23(4): 1\u201311","journal-title":"Mobile Netw Appl"},{"key":"1216_CR24","first-page":"620","volume":"2012","author":"CP Schnorr","year":"2012","unstructured":"Schnorr CP, Shevchenko T (2012) Solving subset sum problems of density close to 1 by randomized BKZ-reduction. IACR Cryptology ePrint Archive 2012:620","journal-title":"IACR Cryptology ePrint Archive"},{"key":"1216_CR25","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-13190-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"Nick Howgrave-Graham","year":"2010","unstructured":"Howgrave-Graham N, Joux A (2010) New generic algorithms for hard knapsacks. In: Gilbert H (ed) Advances in cryptology \u2013 EUROCRYPT 2010. EUROCRYPT 2010. Lecture notes in computer science, vol 6110. Springer, Berlin"},{"key":"1216_CR26","doi-asserted-by":"crossref","unstructured":"Koiliaris K, Xu C (2017) A faster pseudopolynomial time algorithm for subset sum. In: SODA17","DOI":"10.1137\/1.9781611974782.68"},{"key":"1216_CR27","doi-asserted-by":"crossref","unstructured":"Bringmann K (2017) A near-linear pseudopolynomial time algorithm for subset sum. In: Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, pp 1073\u20131084","DOI":"10.1137\/1.9781611974782.69"},{"key":"1216_CR28","doi-asserted-by":"crossref","unstructured":"Jen SM, Lai TL, Lu CY, Yang JF (2012) Knapsack cryptosystems and unreliable reliance on density. In: 2012 IEEE 26th international conference on advanced information networking and applications (AINA). IEEE, pp 748\u2013754","DOI":"10.1109\/AINA.2012.43"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-019-01216-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01216-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01216-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T12:22:53Z","timestamp":1581769373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-019-01216-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,14]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["1216"],"URL":"https:\/\/doi.org\/10.1007\/s11036-019-01216-8","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,14]]},"assertion":[{"value":"14 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}