{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T12:42:28Z","timestamp":1696423348016},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T00:00:00Z","timestamp":1593648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T00:00:00Z","timestamp":1593648000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"SAG,DRDO, New Delhi, India","award":["Letter No DIR\/MEDCoS\/SAG\/P(Others)\/15-16\/005"],"award-info":[{"award-number":["Letter No DIR\/MEDCoS\/SAG\/P(Others)\/15-16\/005"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11227-020-03351-6","type":"journal-article","created":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T18:04:27Z","timestamp":1593713067000},"page":"2734-2769","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Relation collection using Pollard special-q sieving to solve integer factorization and discrete logarithm problem"],"prefix":"10.1007","volume":"77","author":[{"given":"Shubham","family":"Varshney","sequence":"first","affiliation":[]},{"given":"Pankaj","family":"Charpe","sequence":"additional","affiliation":[]},{"given":"R.","family":"Padmavathy","sequence":"additional","affiliation":[]},{"given":"S. K.","family":"Pal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,2]]},"reference":[{"key":"3351_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest R, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public key cryptosystems. Commun ACM 21:120\u2013126","journal-title":"Commun ACM"},{"key":"#cr-split#-3351_CR2.1","doi-asserted-by":"crossref","unstructured":"Kleinjung T, Aoki K, Franke J, Lenstra AK, Thome E, Bos J, Gaudry P, Kruppa A, Montgomery PL, Osvik DA, Te Riele H, Timofeev A, Zimmermann P (2010) Factorization of a 768-bit RSA modulus. In: Rabin T","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"#cr-split#-3351_CR2.2","unstructured":"(ed) Advances in cryptology: CRYPTO 2010, LNCS, vol 6223, Springer, pp 333-350"},{"issue":"6","key":"3351_CR3","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theory 22(6):644\u2013654","journal-title":"IEEE Trans Inf Theory"},{"key":"3351_CR4","doi-asserted-by":"crossref","unstructured":"Barbulescu R, Bouvier C, Detrey J, Gaudry P, Jeljeli H, Thome E, Videau M, Zimmermann P (2014) Discrete logarithm in $$GF(2^{809})$$ with FFS, PKC 2014, LNCS, vol 8383, Springer, pp 221\u2013238","DOI":"10.1007\/978-3-642-54631-0_13"},{"key":"3351_CR5","unstructured":"https:\/\/prog.world\/a-new-achievement-in-cryptography-factorization-of-a-795-bit-rsa-number (2019)"},{"key":"3351_CR6","unstructured":"Abhijit DA (2013) Computational number theory. Chapman and Hall\/CRC 2013 Print. ISBN: 978-1-4398-6615-3"},{"key":"3351_CR7","first-page":"355","volume":"8282","author":"A Joux","year":"2013","unstructured":"Joux A (2013) A new index calculus algorithm with complexity L(1\/4 + o(1)) in very small characteristic. Sel Areas Cryptogr LNCS 8282:355\u2013379","journal-title":"Sel Areas Cryptogr LNCS"},{"key":"3351_CR8","unstructured":"Barbulescu R, Gaudry P, Joux A, Thome E (2013) A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic (preprint), 8 pages. http:\/\/hal.inria.fr\/hal-00835446"},{"key":"3351_CR9","doi-asserted-by":"crossref","unstructured":"Lenstra AK, Lenstra Jr HW (1993) The development of the number field sieve. Springer, LNM, p 1554","DOI":"10.1007\/BFb0091534"},{"key":"3351_CR10","doi-asserted-by":"crossref","unstructured":"Adleman LM (1994) The function field sieve. In: Algorithmic number theory (ANTS-I), LNCS, vol 877, Spinger, Berlin, pp 108\u2013121","DOI":"10.1007\/3-540-58691-1_48"},{"issue":"231","key":"3351_CR11","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1090\/S0025-5718-99-01137-0","volume":"69","author":"O Schirokauer","year":"2000","unstructured":"Schirokauer O (2000) Using number fields to compute logarithms in finite fields. Math Comput 69(231):1267\u20131283","journal-title":"Math Comput"},{"key":"3351_CR12","doi-asserted-by":"crossref","unstructured":"Barbulescu R, Gaudry P, Kleinjung T (2015) The tower number field sieve. In: Advances in cryptology: ASIACRYPT 2015, LNCS, vol 9453, Springer, Berlin","DOI":"10.1007\/978-3-662-48800-3_2"},{"key":"3351_CR13","doi-asserted-by":"crossref","unstructured":"Kim T, Barbulescu R (2016) Extended tower number field sieve: a new complexity for the medium prime case. In: Advances in cryptology\u2014CRYPTO 2016, LNCS, vol 9814, Springer, Berlin","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"3351_CR14","doi-asserted-by":"crossref","unstructured":"Zhu Y, Wen J, Zhuang J, Lv C, Lin D (2020) Theoretical computer science, vol 814, pp 49\u201368","DOI":"10.1016\/j.tcs.2020.01.010"},{"key":"3351_CR15","unstructured":"Granger R, Kleinjung T, Zumbrgel J (2014) Discrete logarithms in GF (29234)\u2014NMBRTHRY list"},{"key":"3351_CR16","doi-asserted-by":"crossref","unstructured":"Granger R, Kleinjung T, Zumbrgel J (2014) Breaking 128-bit secure supersingular binary curves (or how to solve discrete logarithms in F (24\u20131223) and F (212\u2013367). In: CRYPTO, vol 17, pp 126\u2013145","DOI":"10.1007\/978-3-662-44381-1_8"},{"key":"3351_CR17","doi-asserted-by":"crossref","unstructured":"Glaglu F, Granger R, McGuire G, Zumbrgel J (2013) On the function field sieve and the impact of higher splitting probabilities: application to discrete logarithms in F (21971) and F (23164). In: Advances in cryptology: CRYPTO 2013, LNCS , vol 8043, pp 109\u2013128","DOI":"10.1007\/978-3-642-40084-1_7"},{"issue":"4","key":"3351_CR18","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1109\/TIT.2016.2528996","volume":"62","author":"Palash Sarkar","year":"2016","unstructured":"Sarkar Palash (2016) Fine tuning the function field sieve algorithm for the medium prime case. IEEE Trans Inf Theory 62(4):2233\u20132253","journal-title":"IEEE Trans Inf Theory"},{"key":"3351_CR19","doi-asserted-by":"crossref","unstructured":"Sarkar P, Singh S (2016) New complexity trade-offs for the (multiple) number field sieve algorithm in nonprime fields. In: Fischlin M, Coron JS (eds) EUROCRYPT 2016. LNCS, vol 9665, Springer, pp 429\u2013458","DOI":"10.1007\/978-3-662-49890-3_17"},{"key":"3351_CR20","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1090\/S0025-5718-06-01870-9","volume":"75","author":"T Kleinjung","year":"2006","unstructured":"Kleinjung T (2006) On polynomial selection for the general number field sieve. Math. Comput. 75:2037\u20132047","journal-title":"Math. Comput."},{"key":"3351_CR21","unstructured":"Franke J, Kleinjung T (2005) Continued fractions and lattice sieving. In: Proceedings SHARCS 2005. http:\/\/www.ruhrunibochum.de\/itsc\/tanja\/SHARCS\/talks\/FrankeKleinjung.pdf"},{"key":"#cr-split#-3351_CR22.1","doi-asserted-by":"crossref","unstructured":"Aoki K, Ueda H (2004) Sieving using bucket sort. In: Lee PJ","DOI":"10.1007\/978-3-540-30539-2_8"},{"key":"#cr-split#-3351_CR22.2","unstructured":"(ed) Advances in cryptology: ASIACRYPT 2004. ASIACRYPT, LNCS, vol 3329, Springer, Berlin"},{"key":"3351_CR23","doi-asserted-by":"crossref","unstructured":"Gaudry P, Gremy L, Videau M (2016) Collecting relations for the number field sieve in $$\\text{GF}(p^{6})$$. LMS J Comput Math 19(A): 332\u2013350. 10.1112\/S1461157016000164","DOI":"10.1112\/S1461157016000164"},{"key":"3351_CR24","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.amc.2016.08.019","volume":"293","author":"B Sengupta","year":"2017","unstructured":"Sengupta B, Das Abhijit (2017) Use of SIMD-based data parallelism to speed up aieving in integer-factoring alogrithm. Appl Math Comput 293:204\u2013217","journal-title":"Appl Math Comput"},{"key":"3351_CR25","doi-asserted-by":"crossref","unstructured":"Pollard JM (993) The lattice sieve. Lenstra AK, Lenstra HW Jr (eds) The development of the number field sieve, LNM, vol 1554, Springer, Berlin, pp 43\u201349","DOI":"10.1007\/BFb0091538"},{"key":"3351_CR26","unstructured":"Joux A, Lercier R (2001) Discrete logarithms in $$GF(2^n )$$ (521 bits), email to the NMBRTHRY mailing list. http:\/\/listserv.nodak.edu\/archives\/nmbrthry.html"},{"key":"3351_CR27","unstructured":"Joux A, Lercier R (2005) Discrete logarithms in $$GF(2^{607})$$ and $$GF(2^{613})$$. E-mail to the NMBRTHRY mailing list. http:\/\/listserv.nodak.edu\/archives\/nmbrthry"},{"key":"3351_CR28","unstructured":"Herstein IN (1975) Topics in algebra, 2nd edn. ISBN:978-0-471-01090-6"},{"key":"3351_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-07545-7","volume-title":"Algebraic number theory","author":"F Jarvis","year":"2014","unstructured":"Jarvis F (2014) Algebraic number theory. Springer, Berlin"},{"key":"3351_CR30","doi-asserted-by":"publisher","unstructured":"Joux A (2009) Algorithmic cryptanalysis, Chapman and Hall\/CRC 2009 Print ISBN: 978-1-4200-7002-6 eBook ISBN: 978-1-4200-7003-3. https:\/\/doi.org\/10.1201\/9781420070033","DOI":"10.1201\/9781420070033"},{"key":"3351_CR31","unstructured":"Case M (2003) A beginners guide to the general number field sieve. http:\/\/islab.oregonstate.edu\/koc\/ece575\/03Project\/Case\/paper.pdf"},{"key":"3351_CR32","doi-asserted-by":"crossref","unstructured":"Joux A, Lercier R (2002) The function field sieve is quite special. In: Algorithmic numberv theory-ANTS V, LNCS, vol 2369, Springer, pp 431\u2013445","DOI":"10.1007\/3-540-45455-1_34"},{"key":"3351_CR33","unstructured":"Barbulescu R (2013) Selecting polynomials for the function field sieve, preprint, p 23. http:\/\/hal.inria.fr\/hal-00798386"},{"key":"3351_CR34","doi-asserted-by":"crossref","unstructured":"Golliver RA, Lenstra AK, McCurley KS (1994) Lattice sieving and trial division. In: Adleman LM, Huang MD (eds) Algorithmic number theory, LNCS, vol 877, Springer, pp 18\u201327","DOI":"10.1007\/3-540-58691-1_38"},{"key":"3351_CR35","doi-asserted-by":"crossref","unstructured":"JDetrey J, Gaudry P, Videau M (2013) Relation collection for the function field sieve. In: Nannarelli A, Seidel PM, Tang PTP (eds) Proceedings of ARITH-21, pp 201\u2013210","DOI":"10.1109\/ARITH.2013.28"},{"key":"3351_CR36","unstructured":"GGNFS Library. http:\/\/gilchrist.ca\/jeff\/factoring\/nfs-beginners-guide.html"},{"key":"3351_CR37","unstructured":"CADO-NFS Library. http:\/\/cado-nfs.gforge.inria.fr\/"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03351-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-020-03351-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03351-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T09:57:19Z","timestamp":1696327039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-020-03351-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,2]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["3351"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03351-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,2]]},"assertion":[{"value":"2 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}