{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T11:30:18Z","timestamp":1774611018318,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030242671","type":"print"},{"value":"9783030242688","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24268-8_19","type":"book-chapter","created":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T23:03:34Z","timestamp":1563404614000},"page":"202-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Review of the Factorization Problem of Large Integers"],"prefix":"10.1007","author":[{"given":"Xinguo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbin","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,11]]},"reference":[{"issue":"3","key":"19_CR1","first-page":"447","volume":"56","author":"D Li","year":"2018","unstructured":"Li, D., Luo, M., Zhao, B.: Provably secure APK redevelopment authorization scheme in the standard model. Comput. Mater. Cortinua 56(3), 447\u2013465 (2018)","journal-title":"Comput. Mater. Cortinua"},{"issue":"12","key":"19_CR2","first-page":"1473","volume":"43","author":"C Pomerance","year":"1996","unstructured":"Pomerance, C.: A tale of two sieves. Not. AMS 43(12), 1473\u20131485 (1996)","journal-title":"Not. AMS"},{"key":"19_CR3","unstructured":"MathWorld Headline news. \n                      http:\/\/mathworld.wolfram.com\/news\/2003-12-05\/rsa\/\n                      \n                    . Accessed 24 Oct 2018"},{"key":"19_CR4","unstructured":"Factorization of RSA-180. \n                      https:\/\/eprint.iacr.org\/2010\/270.pdf,last\n                      \n                    . Accessed 24 Oct 2018"},{"key":"19_CR5","unstructured":"RSA-190 factored. \n                      https:\/\/mersenneforum.org\/showpost.php?p=236114&postcount=1,last\n                      \n                    . Accessed 24 Oct 2018"},{"key":"19_CR6","unstructured":"MathWorld Headline news. \n                      http:\/\/mathworld.wolfram.com\/news\/2005-11-08\/rsa-640\/,last\n                      \n                    . Accessed 24 Oct 2018"},{"key":"19_CR7","unstructured":"RSA-210 factored. \n                      https:\/\/www.mersenneforum.org\/showpost.php?p=354259,last\n                      \n                    . Accessed 24 Oct 2018"},{"key":"19_CR8","unstructured":"Factorization of RSA-704 with cado-nfs. \n                      https:\/\/eprint.iacr.org\/2012\/369.pdf,last\n                      \n                    . Accessed 24 Oct 2018"},{"key":"19_CR9","unstructured":"Factorization of RSA-220 with cado-nfs. \n                      https:\/\/members.loria.fr\/PZimmermann\/papers\/rsa220.pdf,last\n                      \n                    . Accessed 24 Oct 2018"},{"key":"19_CR10","unstructured":"Factorization of a 768-bit RSA modules. \n                      https:\/\/eprint.iacr.org\/2010\/006.pdf,last\n                      \n                    . Accessed 24 Oct 2018"},{"issue":"3","key":"19_CR11","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."},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01933190","volume":"20","author":"RP Brent","year":"1980","unstructured":"Brent, R.P.: An improved Monte Carlo factorization algorithm. BIT Numer. Math. 20(2), 176\u2013184 (1980)","journal-title":"BIT Numer. Math."},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J. M. Pollard","year":"1974","unstructured":"Pollard, J.M.: Theorems of factorization and primality testing. In: Proceedings of the Cambridge Philosophical Society, vol. 76, no. 3, pp. 521\u2013528 (1974)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"64","DOI":"10.2307\/1971363","volume":"126","author":"HW Lenstra","year":"1987","unstructured":"Lenstra, H.W.: Factoring integers with elliptic curves. Ann. Math. 126(3), 64\u201373 (1987)","journal-title":"Ann. Math."},{"issue":"153","key":"19_CR15","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1090\/S0025-5718-1981-0595059-1","volume":"36","author":"JD Dixon","year":"1981","unstructured":"Dixon, J.D.: Asymptotically fast factorization of integers. Math. Comput. 36(153), 255\u2013260 (1981)","journal-title":"Math. Comput."},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-39757-4_17","volume-title":"Advances in Cryptology","author":"C Pomerance","year":"1985","unstructured":"Pomerance, C.: The quadratic sieve factoring algorithm. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 169\u2013182. Springer, Heidelberg (1985). \n                      https:\/\/doi.org\/10.1007\/3-540-39757-4_17"},{"key":"19_CR17","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0091534","volume-title":"The Development of the Number Field Sieve","year":"1993","unstructured":"Lenstra, A.K., Lenstra, H.W. (eds.): The Development of the Number Field Sieve. LNM, vol. 1554. Springer, Heidelberg (1993). \n                      https:\/\/doi.org\/10.1007\/BFb0091534"},{"key":"19_CR18","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. In: 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE Computer Society Press, Los Alamitos (1994)"},{"issue":"6866","key":"19_CR19","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1038\/414883a","volume":"414","author":"LMK Vandersypen","year":"2001","unstructured":"Vandersypen, L.M.K., Steffen, M.: Experimental realization of Shor\u2019s quantum factoring algorithm using nuclear magnetic resonance. Nature 414(6866), 883\u2013887 (2001)","journal-title":"Nature"},{"issue":"2","key":"19_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.32604\/cmc.2018.03693","volume":"57","author":"X Tang","year":"2018","unstructured":"Tang, X., Xu, J., Duan, B.: A memory-efficient simulation method of Grover\u2019s search algorithm. Comput. Mater. Continua 57(2), 307\u2013319 (2018)","journal-title":"Comput. Mater. Continua"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24268-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T23:08:44Z","timestamp":1563404924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24268-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030242671","9783030242688"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24268-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"incodldos2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icaisconf.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}