{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:26:49Z","timestamp":1746296809190,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_19","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"263-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Power of Leibniz-Like Functions as Oracles"],"prefix":"10.1007","author":[{"given":"Jaeyoon","family":"Kim","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7616-0751","authenticated-orcid":false,"given":"Ilya","family":"Volkovich","sequence":"additional","affiliation":[]},{"given":"Nelson Xuzhi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-58691-1_70","volume-title":"Algorithmic Number Theory","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M., McCurley, K.S.: Open problems in number theoretic complexity, II. In: Adleman, L.M., Huang, M.-D. (eds.) ANTS 1994. LNCS, vol. 877, pp. 291\u2013322. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-58691-1_70"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/0-387-34799-2_7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"E Bach","year":"1990","unstructured":"Bach, E.: Intractable problems in number theory. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 77\u201393. Springer, New York (1990). \nhttps:\/\/doi.org\/10.1007\/0-387-34799-2_7"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1006\/jagm.1993.1038","volume":"15","author":"E Bach","year":"1993","unstructured":"Bach, E., Driscoll, J.R., Shallit, J.: Factor refinement. J. Algorithms 15(2), 199\u2013222 (1993). \nhttps:\/\/doi.org\/10.1006\/jagm.1993.1038","journal-title":"J. Algorithms"},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1137\/0215083","volume":"15","author":"E Bach","year":"1986","unstructured":"Bach, E., Miller, G.L., Shallit, J.: Sums of divisors, perfect numbers and factoring. SIAM J. Comput. 15(4), 1143\u20131154 (1986). \nhttps:\/\/doi.org\/10.1137\/0215083","journal-title":"SIAM J. Comput."},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.04.009","volume":"54","author":"D Bernstein","year":"2005","unstructured":"Bernstein, D.: Factoring into coprimes in essentially linear time. J. Algorithms 54(1), 1\u201330 (2005). \nhttps:\/\/doi.org\/10.1016\/j.jalgor.2004.04.009","journal-title":"J. Algorithms"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Gathen, J.V.Z.: Who was who in polynomial factorization. In: Trager, B.M. (ed.) Symbolic and Algebraic Computation, International Symposium, ISSAC. p. 2. ACM (2006). \nhttps:\/\/doi.org\/10.1145\/1145768.1145770","DOI":"10.1145\/1145768.1145770"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Kaltofen, E.: Polynomial factorization: a success story. In: Sendra, J.R. (ed.) Symbolic and Algebraic Computation, International Symposium, ISSAC. pp. 3\u20134. ACM (2003). \nhttps:\/\/doi.org\/10.1145\/860854.860857","DOI":"10.1145\/860854.860857"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/0890-5401(88)90028-4","volume":"78","author":"S Landau","year":"1988","unstructured":"Landau, S.: Some remarks on computing the square parts of integers. Inf. Comput. 78(3), 246\u2013253 (1988). \nhttps:\/\/doi.org\/10.1016\/0890-5401(88)90028-4","journal-title":"Inf. Comput."},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"13","author":"GL Miller","year":"1976","unstructured":"Miller, G.L.: Riemann\u2019s hypothesis and tests for primality. J. Comput. Syst. Sci. 13(3), 300\u2013317 (1976). \nhttps:\/\/doi.org\/10.1016\/S0022-0000(76)80043-8","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR11","unstructured":"Morain, F., Renault, G., Smith, B.: Deterministic factoring with oracles. CoRR abs\/1802.08444 (2018). \nhttp:\/\/arxiv.org\/abs\/1802.08444"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0020-0190(85)90084-5","volume":"20","author":"J Shallit","year":"1985","unstructured":"Shallit, J., Shamir, A.: Number-theoretic functions which are equivalent to number of divisors. Inf. Process. Lett. 20(3), 151\u2013153 (1985). \nhttps:\/\/doi.org\/10.1016\/0020-0190(85)90084-5","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0890-5401(87)90030-7","volume":"72","author":"H Woll","year":"1987","unstructured":"Woll, H.: Reductions among number theoretic problems. Inf. Comput. 72(3), 167\u2013179 (1987). \nhttps:\/\/doi.org\/10.1016\/0890-5401(87)90030-7","journal-title":"Inf. Comput."},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Yun, D.Y.Y.: On square-free decomposition algorithms. In: SYMSAC 1976, Proceedings of the third ACM Symposium on Symbolic and Algebraic Manipulation, Yorktown Heights, New York, USA, 10\u201312 August 1976, pp. 26\u201335. ACM (1976). \nhttps:\/\/doi.org\/10.1145\/800205.806320","DOI":"10.1145\/800205.806320"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:06:22Z","timestamp":1592780782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","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":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","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":"51% - 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":"7","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":"The conference was cancelled as a live conference due to the corona pandemic.","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)"}}]}}