{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:09:21Z","timestamp":1757617761697,"version":"3.44.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T00:00:00Z","timestamp":1744243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T00:00:00Z","timestamp":1744243200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2024JBZY011"],"award-info":[{"award-number":["2024JBZY011"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002015","11701552"],"award-info":[{"award-number":["62002015","11701552"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10623-025-01590-3","type":"journal-article","created":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T12:09:46Z","timestamp":1744286986000},"page":"3011-3027","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Utilizing two subfields to accelerate individual logarithm computation in extended tower number field sieve"],"prefix":"10.1007","volume":"93","author":[{"given":"Yuqing","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Chang","family":"Lv","sequence":"additional","affiliation":[]},{"given":"Jiqiang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,10]]},"reference":[{"key":"1590_CR1","doi-asserted-by":"publisher","first-page":"4059","DOI":"10.1007\/s10623-023-01282-w","volume":"91","author":"H Al Aswad","year":"2023","unstructured":"Al Aswad H., Pierrot C.: Individual discrete logarithm with sublattice reduction. Des. Codes Cryptogr. 91, 4059\u20134091 (2023).","journal-title":"Des. Codes Cryptogr."},{"key":"1590_CR2","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1007\/s00145-018-9280-5","volume":"32","author":"R Barbulescu","year":"2019","unstructured":"Barbulescu R., Duquesne S.: Updating key size estimations for pairings. J. Cryptol. 32, 1298\u20131336 (2019).","journal-title":"J. Cryptol."},{"key":"1590_CR3","unstructured":"Barbulescu R., El\u00a0Mrabet N., Ghammam L.: A taxonomy of pairings, their security, their complexity. Cryptology ePrint Archive, Paper 2019\/485 (2019)."},{"key":"1590_CR4","doi-asserted-by":"crossref","unstructured":"Barbulescu R., Gaudry P., Guillevic A., Morain F.: Improving NFS for the discrete logarithm problem in non-prime finite fields. In: Advances in Cryptology\u2014EUROCRYPT 2015, pp. 129\u2013155. Springer (2015).","DOI":"10.1007\/978-3-662-46800-5_6"},{"key":"1590_CR5","doi-asserted-by":"crossref","unstructured":"Barbulescu R., Gaudry P., Joux, A., Thom\u00e9 E.: A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Advances in Cryptology\u2014EUROCRYPT 2014, pp. 1\u201316 (2014).","DOI":"10.1007\/978-3-642-55220-5_1"},{"key":"1590_CR6","doi-asserted-by":"crossref","unstructured":"Barbulescu R., Gaudry P., Kleinjung T.: The tower number field sieve. In: Advances in Cryptology\u2014ASIACRYPT 2015, pp. 31\u201355. Springer (2015).","DOI":"10.1007\/978-3-662-48800-3_2"},{"issue":"A","key":"1590_CR7","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/S1461157014000369","volume":"17","author":"R Barbulescu","year":"2014","unstructured":"Barbulescu R., Pierrot C.: The multiple number field sieve for medium-and high-characteristic finite fields. LMS J. Comput. Math. 17(A), 230\u2013246 (2014).","journal-title":"LMS J. Comput. Math."},{"key":"1590_CR8","doi-asserted-by":"crossref","unstructured":"Barreto P.S.L.M., Lynn B., Scott M.: Constructing elliptic curves with prescribed embedding degrees. In: Security in Communication Networks\u2013SCN 2002, pp. 257\u2013267. Springer (2003).","DOI":"10.1007\/3-540-36413-7_19"},{"key":"1590_CR9","doi-asserted-by":"crossref","unstructured":"Barreto P.S.L.M., Naehrig M.: Pairing-friendly elliptic curves of prime order. In: Selected Areas in Cryptography\u2014SAC 2005, vol.\u00a03897, pp. 319\u2013331. Springer (2006).","DOI":"10.1007\/11693383_22"},{"issue":"2","key":"1590_CR10","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/0605029","volume":"5","author":"IF Blake","year":"1984","unstructured":"Blake I.F., Fuji-Hara R., Mullin R.C., Vanstone S.A.: Computing logarithms in finite fields of characteristic two. SIAM J. Algebraic Discret. Methods 5(2), 276\u2013285 (1984).","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"1590_CR11","doi-asserted-by":"crossref","unstructured":"Commeine A., Semaev I.: An algorithm to solve the discrete logarithm problem with the number field sieve. In: Public Key Cryptography\u2014PKC 2006, pp. 174\u2013190. Springer (2006).","DOI":"10.1007\/11745853_12"},{"key":"1590_CR12","doi-asserted-by":"crossref","unstructured":"De\u00a0Micheli G., Gaudry P., Pierrot C.: Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields. In: Advances in Cryptology\u2014CRYPTO 2020, pp. 32\u201361. Springer (2020).","DOI":"10.1007\/978-3-030-56880-1_2"},{"issue":"6","key":"1590_CR13","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W., Hellman M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1590_CR14","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1590_CR15","unstructured":"Fotiadis G., Martindale C.: Optimal TNFS-secure pairings on elliptic curves with composite embedding degree. Cryptology ePrint Archive, Paper 2019\/555 (2019)."},{"key":"1590_CR16","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1112\/S1461157016000164","volume":"19","author":"P Gaudry","year":"2016","unstructured":"Gaudry P., Gr\u00e9my L., Videau M.: Collecting relations for the number field sieve in GF$$(p^6)$$. LMS J. Comput. Math. 19, 332\u2013350 (2016).","journal-title":"LMS J. Comput. Math."},{"issue":"1","key":"1590_CR17","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"DM Gordon","year":"1993","unstructured":"Gordon D.M.: Discrete logarithms in GF$$(p)$$ using the number field sieve. SIAM J. Discret. Math. 6(1), 124\u2013138 (1993).","journal-title":"SIAM J. Discret. Math."},{"key":"1590_CR18","doi-asserted-by":"publisher","first-page":"3129","DOI":"10.1090\/tran\/7027","volume":"370","author":"R Granger","year":"2017","unstructured":"Granger R., Kleinjung T., Zumbr\u00e4gel J.: On the discrete logarithm problem in finite fields of fixed characteristic. Trans. Am. Math. Soc. 370, 3129\u20133145 (2017).","journal-title":"Trans. Am. Math. Soc."},{"key":"1590_CR19","doi-asserted-by":"crossref","unstructured":"Gr\u00e9my L., Guillevic A., Morain F., Thom\u00e9 E.: Computing discrete logarithms in GF$$(p^6)$$. In: Selected Areas in Cryptography\u2014SAC 2017, vol. 10719, pp. 85\u2013105. Springer (2018).","DOI":"10.1007\/978-3-319-72565-9_5"},{"key":"1590_CR20","doi-asserted-by":"crossref","unstructured":"Guillevic A.: Computing individual discrete logarithms faster in GF$$(p^n)$$ with the NFS-DL algorithm. In: Advances in Cryptology\u2014ASIACRYPT 2015, pp. 149\u2013173. Springer (2015).","DOI":"10.1007\/978-3-662-48797-6_7"},{"issue":"317","key":"1590_CR21","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1090\/mcom\/3376","volume":"88","author":"A Guillevic","year":"2019","unstructured":"Guillevic A.: Faster individual discrete logarithms in finite fields of composite extension degree. Math. Comput. 88(317), 1273\u20131301 (2019).","journal-title":"Math. Comput."},{"key":"1590_CR22","doi-asserted-by":"crossref","unstructured":"Guillevic A.: A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level. In: Public Key Cryptography\u2014PKC 2020, pp. 535\u2013564. Springer (2020).","DOI":"10.1007\/978-3-030-45388-6_19"},{"issue":"1","key":"1590_CR23","first-page":"1","volume":"1","author":"A Guillevic","year":"2021","unstructured":"Guillevic A., Singh S.: On the alpha value of polynomials in the tower number field sieve algorithm. Math. Cryptol. 1(1), 1\u201339 (2021).","journal-title":"Math. Cryptol."},{"issue":"242","key":"1590_CR24","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1090\/S0025-5718-02-01482-5","volume":"72","author":"A Joux","year":"2003","unstructured":"Joux A., Lercier R.: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the Gaussian integer method. Math. Comput. 72(242), 953\u2013967 (2003).","journal-title":"Math. Comput."},{"key":"1590_CR25","doi-asserted-by":"crossref","unstructured":"Joux A., Lercier R., Smart N., Vercauteren F.: The number field sieve in the medium prime case. In: Advances in Cryptology\u2014CRYPTO 2006, pp. 326\u2013344. Springer (2006).","DOI":"10.1007\/11818175_19"},{"key":"1590_CR26","doi-asserted-by":"crossref","unstructured":"Joux A., Pierrot C.: The special number field sieve in $$\\mathbb{F} _{p^n}$$, application to pairing-friendly constructions. In: 6th International Conference on Pairing-Based Cryptography, Pairing 2013, vol.\u00a08365, pp. 45\u201361. Springer (2013).","DOI":"10.1007\/978-3-319-04873-4_3"},{"key":"1590_CR27","doi-asserted-by":"crossref","unstructured":"Kachisa E.J., Schaefer E.F., Scott M.: Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: International Conference on Pairing-Based Cryptography, pp. 126\u2013135. Springer (2008).","DOI":"10.1007\/978-3-540-85538-5_9"},{"issue":"1","key":"1590_CR28","first-page":"73","volume":"8","author":"M Kalkbrener","year":"1997","unstructured":"Kalkbrener M.: An upper bound on the number of monomials in determinants of sparse matrices with symbolic entries. Math. Pannon. 8(1), 73\u201382 (1997).","journal-title":"Math. Pannon."},{"key":"1590_CR29","doi-asserted-by":"crossref","unstructured":"Kim T., Barbulescu R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Advances in Cryptology\u2014CRYPTO 2016, pp. 543\u2013571. Springer (2016).","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"1590_CR30","doi-asserted-by":"crossref","unstructured":"Kim T., Jeong J.: Extended tower number field sieve with application to finite fields of arbitrary composite extension degree. In: Public Key Cryptography\u2014PKC 2017, pp. 388\u2013408. Springer (2017).","DOI":"10.1007\/978-3-662-54365-8_16"},{"issue":"2","key":"1590_CR31","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1090\/jams\/985","volume":"35","author":"T Kleinjung","year":"2022","unstructured":"Kleinjung T., Wesolowski B.: Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. J. Am. Math. Soc. 35(2), 581\u2013624 (2022).","journal-title":"J. Am. Math. Soc."},{"issue":"4","key":"1590_CR32","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. Math. Ann. 261(4), 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"1590_CR33","first-page":"121","volume":"9","author":"DV Matyukhin","year":"2006","unstructured":"Matyukhin D.V.: Effective version of the number field sieve for discrete logarithm in a field GF$$(p^k)$$. Trudy po Diskretnoi Matematike 9, 121\u2013151 (2006).","journal-title":"Trudy po Diskretnoi Matematike"},{"key":"1590_CR34","doi-asserted-by":"crossref","unstructured":"Menezes A., Sarkar P., Singh S.: Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography. In: Paradigms in Cryptology\u2014Mycrypt 2016, pp. 83\u2013108. Springer (2017).","DOI":"10.1007\/978-3-319-61273-7_5"},{"issue":"5","key":"1590_CR35","first-page":"1234","volume":"84","author":"A Miyaji","year":"2001","unstructured":"Miyaji A., Nakabayashi M., Takano S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 84(5), 1234\u20131243 (2001).","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"1590_CR36","doi-asserted-by":"crossref","unstructured":"Pierrot C.: The multiple number field sieve with Conjugation and Generalized Joux-Lercier methods. In: Advances in Cryptology\u2014EUROCRYPT 2015, pp. 156\u2013170. Springer (2015).","DOI":"10.1007\/978-3-662-46800-5_7"},{"key":"1590_CR37","doi-asserted-by":"crossref","unstructured":"Sarkar P., Singh S.: New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields. In: Advances in Cryptology\u2014EUROCRYPT 2016, pp. 429\u2013458. Springer (2016).","DOI":"10.1007\/978-3-662-49890-3_17"},{"issue":"3","key":"1590_CR38","doi-asserted-by":"publisher","first-page":"435","DOI":"10.3934\/amc.2019028","volume":"13","author":"P Sarkar","year":"2019","unstructured":"Sarkar P., Singh S.: A unified polynomial selection method for the (tower) number field sieve algorithm. Adv. Math. Commun. 13(3), 435\u2013455 (2019).","journal-title":"Adv. Math. Commun."},{"issue":"1676","key":"1590_CR39","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1098\/rsta.1993.0139","volume":"345","author":"O Schirokauer","year":"1993","unstructured":"Schirokauer O.: Discrete logarithms and local units. Philos. Trans. R. Soc. Lond. A: Math. Phys. Eng. Sci. 345(1676), 409\u2013423 (1993).","journal-title":"Philos. Trans. R. Soc. Lond. A: Math. Phys. Eng. Sci."},{"issue":"231","key":"1590_CR40","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.: Using number fields to compute logarithms in finite fields. Math. Comput. 69(231), 1267\u20131283 (2000).","journal-title":"Math. Comput."},{"key":"1590_CR41","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2020.01.010","volume":"814","author":"Y Zhu","year":"2020","unstructured":"Zhu Y., Wen J., Zhuang J., Lv C., Lin D.: Refined analysis to the extended tower number field sieve. Theor. Comput. Sci. 814, 49\u201368 (2020).","journal-title":"Theor. Comput. Sci."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01590-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01590-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01590-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T10:44:22Z","timestamp":1757155462000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01590-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,10]]},"references-count":41,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1590"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01590-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,4,10]]},"assertion":[{"value":"6 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}