{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T10:09:21Z","timestamp":1767262161623,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030950170"},{"type":"electronic","value":"9783030950187"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95018-7_19","type":"book-chapter","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:04Z","timestamp":1642982704000},"page":"237-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Algebraic Algorithms for\u00a0Variants of\u00a0Subset Sum"],"prefix":"10.1007","author":[{"given":"Pranjal","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahesh Sreekumar","family":"Rajasree","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"19_CR1","unstructured":"Lewis, H.R.: Computers and Intractability. A Guide to the Theory of NP-Completeness (1983)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-11799-2_23","volume-title":"Theory of Cryptography","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Palacio, A., Segev, G.: Public-key cryptographic primitives provably as secure as subset sum. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 382\u2013400. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_23"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-662-49384-7_2","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"S Faust","year":"2016","unstructured":"Faust, S., Masny, D., Venturi, D.: Chosen-ciphertext security from subset sum. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9614, pp. 35\u201346. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49384-7_2"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Wellnitz, P.: On near-linear-time algorithms for dense subset sum. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1777\u20131796. SIAM (2021)","DOI":"10.1137\/1.9781611976465.107"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bringmann, K.: A near-linear pseudopolynomial time algorithm for subset sum. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1073\u20131084. SIAM (2017)","DOI":"10.1137\/1.9781611974782.69"},{"key":"19_CR6","unstructured":"Jin, C., Wu, H.: A simple near-linear pseudopolynomial time randomized algorithm for subset sum. arXiv preprint arXiv:1807.11597 (2018)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Jin, C., Vyas, N., Williams, R.: Fast low-space algorithms for subset sum. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1757\u20131776. SIAM (2021)","DOI":"10.1137\/1.9781611976465.106"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Esser, A., May, A.: Low weight discrete logarithm and subset sum in 20. 65n with polynomial memory. Memory 1, 2 (2020)","DOI":"10.1007\/978-3-030-45727-3_4"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-38616-9_2","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2013","unstructured":"Bernstein, D.J., Jeffery, S., Lange, T., Meurer, A.: Quantum algorithms for the subset-sum problem. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 16\u201333. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_2"},{"key":"19_CR10","unstructured":"Helm, A., May, A.: Subset sum quantumly in 1.17$$^{\\wedge }$$ n. In: 13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"19_CR11","unstructured":"Li, Y., Li, H.: Improved quantum algorithm for the random subset sum problem. arXiv preprint arXiv:1912.09264 (2019)"},{"key":"19_CR12","unstructured":"Bellman, R.E.: Dynamic Programming (1957)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Klivans, A.R., Spielman, D.: Randomness efficient identity testing of multivariate polynomials. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 216\u2013223 (2001)","DOI":"10.1145\/380752.380801"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Abboud, A., Bringmann, K., Hermelin, D., Shabtay, D.: Seth-based lower bounds for subset sum and bicriteria path. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 41\u201357. SIAM (2019)","DOI":"10.1137\/1.9781611975482.3"},{"key":"19_CR15","unstructured":"McKay, D.M., Williams, R.R.: Quadratic time-space lower bounds for computing natural functions with a random oracle. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"19_CR16","unstructured":"Kane, D.M.: Unary subset-sum is in logspace. arXiv preprint arXiv:1012.1336 (2010)"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1999.1034","volume":"33","author":"D Pisinger","year":"1999","unstructured":"Pisinger, D.: Linear time algorithms for knapsack problems with bounded weights. J. Algorithms 33(1), 1\u201314 (1999)","journal-title":"J. Algorithms"},{"issue":"3","key":"19_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3329863","volume":"15","author":"K Koiliaris","year":"2019","unstructured":"Koiliaris, K., Chao, X.: Faster pseudopolynomial time algorithms for subset sum. ACM Trans. Algorithms (TALG) 15(3), 1\u201320 (2019)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"19_CR19","unstructured":"Koiliaris, K., Xu, C.: Subset sum made simple. arXiv preprint arXiv:1807.08248 (2018)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Nederlof, J.: Saving space by Algebraization. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 321\u2013330 (2010)","DOI":"10.1145\/1806689.1806735"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 345\u2013354 (1987)","DOI":"10.1145\/28395.383347"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Von Zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (2013)","DOI":"10.1017\/CBO9781139856065"},{"issue":"6","key":"19_CR23","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1515\/integers-2012-0043","volume":"12","author":"P Moree","year":"2012","unstructured":"Moree, P.: Artin\u2019s primitive root conjecture-a survey. Integers 12(6), 1305\u20131416 (2012)","journal-title":"Integers"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Gupta, R., Ram Murty, M.: A remark on Artin\u2019s conjecture. Inventiones Math. 78(1), 127\u2013130 (1984)","DOI":"10.1007\/BF01388719"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s, P., Ram Murty, M.: On the order of a (mod p). In: CRM Proceedings and Lecture Notes, vol. 19, pp. 87\u201397 (1999)","DOI":"10.1090\/crmp\/019\/10"},{"issue":"1","key":"19_CR26","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jnt.2003.06.005","volume":"105","author":"K Chinen","year":"2004","unstructured":"Chinen, K., Murata, L.: On a distribution property of the residual order of a (mod p). J. Number Theory 105(1), 60\u201381 (2004)","journal-title":"J. Number Theory"},{"issue":"2","key":"19_CR27","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0304-3975(95)00164-6","volume":"157","author":"I Shparlinski","year":"1996","unstructured":"Shparlinski, I.: On finding primitive roots in finite fields. Theoret. Comput. Sci. 157(2), 273\u2013275 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"19_CR28","first-page":"177","volume":"28","author":"J Nagura","year":"1952","unstructured":"Nagura, J.: On the interval containing at least one prime number. Proc. Jpn. Acad. 28(4), 177\u2013181 (1952)","journal-title":"Proc. Jpn. Acad."},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: Primes is in p. Ann. Math. 160, 781\u2013793 (2004)","DOI":"10.4007\/annals.2004.160.781"},{"issue":"5","key":"19_CR30","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0020-0190(90)90195-4","volume":"33","author":"V Shoup","year":"1990","unstructured":"Shoup, V.: On the deterministic complexity of factoring polynomials over finite fields. Inf. Process. Lett. 33(5), 261\u2013267 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"296","key":"19_CR31","doi-asserted-by":"publisher","first-page":"2969","DOI":"10.1090\/mcom\/2946","volume":"84","author":"J Bourgain","year":"2015","unstructured":"Bourgain, J., Konyagin, S., Shparlinski, I.: Character sums and deterministic polynomial root finding in finite fields. Math. Comput. 84(296), 2969\u20132977 (2015)","journal-title":"Math. Comput."},{"issue":"1","key":"19_CR32","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1006\/inco.1998.2732","volume":"146","author":"A Maciel","year":"1998","unstructured":"Maciel, A., Therien, D.: Threshold circuits of small majority-depth. Inf. Comput. 146(1), 55\u201383 (1998)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95018-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T07:25:05Z","timestamp":1674545105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95018-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030950170","9783030950187"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95018-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puducherry","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acsdm.org\/caldam\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}