{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:42:06Z","timestamp":1743147726264,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_19","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"212-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Quantum Version of Pollard\u2019s Rho of Which Shor\u2019s Algorithm is a Particular\u00a0Case"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Chicayban Bastos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis Antonio","family":"Kowada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1038\/scientificamerican0308-62","volume":"298","author":"S Aaronson","year":"2008","unstructured":"Aaronson, S.: The limits of quantum. Sci. Am. 298(3), 62\u201369 (2008)","journal-title":"Sci. Am."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Beauregard, S.: Circuit for Shor\u2019s Algorithm using $$2n+3$$ qubits (2002). http:\/\/arxiv.org\/abs\/quant-ph\/0205095","DOI":"10.26421\/QIC3.2-8"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1103\/PhysRevA.54.1034","volume":"54","author":"D Beckman","year":"1996","unstructured":"Beckman, D., Chari, A.N., Devabhaktuni, S., Preskill, J.: Efficient networks for quantum factoring. Phys. Rev. A 54, 1034\u20131063 (1996). https:\/\/doi.org\/10.1103\/PhysRevA.54.1034","journal-title":"Phys. Rev. A"},{"key":"19_CR4","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press (2013). ISBN 978-1-107-03903-2"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Gauss, C.F.: Disquisitiones Arithmeticae. English edn. Springer, Heidelberg (1986)","DOI":"10.1007\/978-1-4939-7560-0"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley Publishing Company Inc. (1989)","DOI":"10.1063\/1.4822863"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BFb0020422","volume-title":"Distributed Algorithms","author":"AK Lenstra","year":"1994","unstructured":"Lenstra, A.K.: Factoring. In: Tel, G., Vit\u00e1nyi, P. (eds.) WDAG 1994. LNCS, vol. 857, pp. 28\u201338. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0020422"},{"key":"19_CR8","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge Series on Information and the Natural Sciences, 1st edn. Cambridge University Press (2004)"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"JM Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo method for factorization. BIT Numer. Math. 15(3), 331\u2013334 (1975)","journal-title":"BIT Numer. Math."},{"key":"19_CR10","unstructured":"Pomerance, C.: Analysis and comparison of some integer factoring algorithms. Comput. Methods Number Theory 89\u2013139 (1982)"},{"key":"19_CR11","unstructured":"Rabin, M.O.: Digitalized signatures and public-key functions as intractable as factorization. Technical Report MIT\/LCS\/TR-212, Massachusetts Institute of Technology, Cambridge, Massachusetts (1979)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","DOI":"10.1145\/359340.359342"},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, SFCS 1994, Washington, DC, USA, pp. 124\u2013134. IEEE Computer Society (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"5","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/s0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/s0097539795293172","journal-title":"SIAM J. Comput."},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Stinson, D.R., Paterson, M.B.: Cryptography. Theory and Practice, 4th edn. CRC Press (2018)","DOI":"10.1201\/9781315282497"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Wagstaff, S.S.: The Joy of Factoring, vol. 68. American Mathematical Society (2013)","DOI":"10.1090\/stml\/068"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation grosser Zahlen. Computing 7, 281\u2013292 (1971)","DOI":"10.1007\/BF02242355"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:04:39Z","timestamp":1680213879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-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":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}