{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:04:23Z","timestamp":1772805863937,"version":"3.50.1"},"reference-count":34,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2018]]},"DOI":"10.3934\/amc.2018026","type":"journal-article","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T04:32:34Z","timestamp":1533357154000},"page":"429-449","source":"Crossref","is-referenced-by-count":1,"title":["Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme"],"prefix":"10.3934","volume":"12","author":[{"given":"Konstantinos A.","family":"Draziotis","sequence":"first","affiliation":[]},{"given":"Anastasia","family":"Papadopoulou","sequence":"additional","affiliation":[{"name":"Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki 54124, Greece"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2018026-1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69346-7_18"},{"key":"key-10.3934\/amc.2018026-2","doi-asserted-by":"publisher","unstructured":"K. Aardal and F. Eisenbrand, The LLL Algorithm and Integer Programming, <i>The LLL Algorithm (Survey and Applications)<\/i>, Springer, 2010, 293\u2013314.","DOI":"10.1007\/978-3-642-02295-1_9"},{"key":"key-10.3934\/amc.2018026-3","doi-asserted-by":"publisher","unstructured":"M. Ajtai, The shortest vector problem in $L_2$ is NP-hard for randomized reduction, <i>Proc. 30th ACM Symposium on Theory of Computing (STOC)<\/i>, 1998, 10-19.","DOI":"10.1145\/276698.276705"},{"key":"key-10.3934\/amc.2018026-4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_21"},{"key":"key-10.3934\/amc.2018026-5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201999"},{"key":"key-10.3934\/amc.2018026-6","unstructured":"I. Damg\u00e5rd, On Sigma-protocols, <a href=\"http:\/\/www.cs.au.dk\/~ivan\/Sigma.pdf\" target=\"_blank\">http:\/\/www.cs.au.dk\/~ivan\/Sigma.pdf<\/a>, Course material, 2010."},{"key":"key-10.3934\/amc.2018026-7","doi-asserted-by":"publisher","unstructured":"K. A. Draziotis, Balanced Integer solutions of linear equations, <i>AMIMS 2013(Greece), Optimization and its Applications (SOIA)<\/i>, Springer, <b>91<\/b> (2014), 173\u2013188.","DOI":"10.1007\/978-3-319-04720-1_11"},{"key":"key-10.3934\/amc.2018026-8","unstructured":"K. A. Draziotis and A. Papadopoulou, <a href=\"https:\/\/github.com\/drazioti\/python_scripts\/tree\/master\/paper_knapsack\" target=\"_blank\">https:\/\/github.com\/drazioti\/python_scripts\/tree\/master\/paper_knapsack<\/a>."},{"key":"key-10.3934\/amc.2018026-9","doi-asserted-by":"publisher","DOI":"10.1137\/0215038"},{"key":"key-10.3934\/amc.2018026-10","doi-asserted-by":"publisher","unstructured":"S. Galbraith, <i>Mathematics of Public Key Cryptography<\/i>, Cambridge University Press, 2012.","DOI":"10.1017\/CBO9781139012843"},{"key":"key-10.3934\/amc.2018026-11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_13"},{"key":"key-10.3934\/amc.2018026-12","doi-asserted-by":"publisher","unstructured":"N. Gama and P. Q. Nguyen, Predicting lattice reduction, <i>LNCS<\/i>, Springer, <b>4965<\/b> (2008), 31\u201351.","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"key-10.3934\/amc.2018026-13","unstructured":"M. R. Garey and David S. Johnson, <i>Computers and Intractability: A Guide to the Theory of NP-Completeness<\/i>, W. H. Freeman, 1979."},{"key":"key-10.3934\/amc.2018026-14","doi-asserted-by":"publisher","unstructured":"G. Hanrot, X. Pujol and D. Stehl\u00e9. Analyzing blockwise lattice algorithms using dynamical systems, <i>LNCS<\/i>, Springer, <b>6841<\/b> (2011), 447\u2013464.","DOI":"10.1007\/978-3-642-22792-9_25"},{"key":"key-10.3934\/amc.2018026-15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_12"},{"key":"key-10.3934\/amc.2018026-16","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900012"},{"key":"key-10.3934\/amc.2018026-17","doi-asserted-by":"publisher","DOI":"10.1145\/2455.2461"},{"key":"key-10.3934\/amc.2018026-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.07.063"},{"key":"key-10.3934\/amc.2018026-19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"key-10.3934\/amc.2018026-20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78440-1_10"},{"key":"key-10.3934\/amc.2018026-21","doi-asserted-by":"publisher","unstructured":"A. May and M.Herrmann, Solving linear equations modulo divisors: On factoring given any bits, In <i>Advances in Cryptology (Asiacrypt 2008)<\/i>, <b>5350<\/b> (2008), 406\u2013424.","DOI":"10.1007\/978-3-540-89255-7_25"},{"key":"key-10.3934\/amc.2018026-22","doi-asserted-by":"publisher","unstructured":"D. Micciancio and O. Regev, Lattice-Based Cryptography, <i>In Post Quantum Cryptography<\/i>, Springer, 2009, 147\u2013191.","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"key-10.3934\/amc.2018026-23","doi-asserted-by":"publisher","unstructured":"D. Micciancio and S. Goldwasser, <i>Complexity of Lattice Problems A cryptographic Perspective<\/i>, Springer 2002.","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"key-10.3934\/amc.2018026-24","doi-asserted-by":"publisher","unstructured":"R. Motwani and P. Raghavan, <i>Randomized Algorithms<\/i>, Cambridge University Press, Cambridge, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"key-10.3934\/amc.2018026-25","unstructured":"The FpLLL development team, fplll, Available at <a href=\"https:\/\/github.com\/fplll\/fplll\" target=\"_blank\">https:\/\/github.com\/fplll\/fplll<\/a>."},{"key":"key-10.3934\/amc.2018026-26","unstructured":"The FpyLLL development team, fpylll: A python interface for fplll, Available at <a href=\"https:\/\/github.com\/fplll\/fpylll\" target=\"_blank\">https:\/\/github.com\/fplll\/fpylll<\/a>."},{"key":"key-10.3934\/amc.2018026-27"},{"key":"key-10.3934\/amc.2018026-28","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"key-10.3934\/amc.2018026-29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581144"},{"key":"key-10.3934\/amc.2018026-30","unstructured":"C.-P. Schnorr and T. Shevchenko, Solving Subset Sum Problems of Density close to 1 by \"randomized\" BKZ-reduction. <i>Cryptology ePrint Archive<\/i>, Report <b>2012\/620<\/b>."},{"key":"key-10.3934\/amc.2018026-31","doi-asserted-by":"publisher","DOI":"10.1137\/0210033"},{"key":"key-10.3934\/amc.2018026-32","unstructured":"The Sage Developers, SageMath, the Sage Mathematics Software System (Ver. 6.9) <a href=\"http:\/\/www.sagemath.org\" target=\"_blank\">http:\/\/www.sagemath.org<\/a>."},{"key":"key-10.3934\/amc.2018026-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.03.010"},{"key":"key-10.3934\/amc.2018026-34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.05.015"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2018_3_429.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:58:52Z","timestamp":1772791132000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2018026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2018026","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}