{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:22:16Z","timestamp":1772806936173,"version":"3.50.1"},"reference-count":36,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2019]]},"DOI":"10.3934\/amc.2019028","type":"journal-article","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T20:10:02Z","timestamp":1555272602000},"page":"435-455","source":"Crossref","is-referenced-by-count":7,"title":["A unified polynomial selection method for the (tower) number field sieve algorithm"],"prefix":"10.3934","volume":"13","author":[{"given":"Palash","family":"Sarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shashank","family":"Singh","sequence":"additional","affiliation":[{"name":"Indian Institute of Science Education and Research Bhopal, Bhopal 462066, Madhya Pradesh, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2019028-1","doi-asserted-by":"crossref","unstructured":"<p>L. M. Adleman, The function field sieve, In Leonard M. Adleman and Ming-Deh A. Huang, editors, <i>ANTS<\/i>, volume 877 of <i>Lecture Notes in Computer Science<\/i>, pages 108\u2013121. Springer, 1994.<\/p>","DOI":"10.1007\/3-540-58691-1_48"},{"key":"key-10.3934\/amc.2019028-2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2761"},{"key":"key-10.3934\/amc.2019028-3","unstructured":"<p>R. Barbulescu and S. Duquesne, Updating key size estimations for pairings, <i>Journal of Cryptology<\/i>, 2018, 1\u201339. <a href=\"https:\/\/link.springer.com\/article\/10.1007\/s00145-018-9280-5\" target=\"_blank\">https:\/\/link.springer.com\/article\/10.1007\/s00145-018-9280-5<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019028-4","doi-asserted-by":"crossref","unstructured":"<p>R. Barbulescu, P. Gaudry, A. Guillevic and F. Morain, Improving NFS for the discrete logarithm problem in non-prime finite fields, In Elisabeth Oswald and Marc Fischlin, editors, <i>Advances in Cryptology \u2013 EUROCRYPT 2015<\/i>, volume 9056 of <i>Lecture Notes in Computer Science<\/i>, pages 129\u2013155. Springer Berlin Heidelberg, 2015.<\/p>","DOI":"10.1007\/978-3-662-46800-5_6"},{"key":"key-10.3934\/amc.2019028-5","doi-asserted-by":"crossref","unstructured":"<p>R. Barbulescu, P. Gaudry, A. Joux and E. Thom\u00e9, A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic, In Phong Q. Nguyen and Elisabeth Oswald, editors, <i>Advances in Cryptology - EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings<\/i>, volume 8441 of <i>Lecture Notes in Computer Science<\/i>, pages 1\u201316. Springer, 2014.<\/p>","DOI":"10.1007\/978-3-642-55220-5_1"},{"key":"key-10.3934\/amc.2019028-6","doi-asserted-by":"crossref","unstructured":"<p>R. Barbulescu, P. Gaudry and T. Kleinjung, The tower number field sieve, In Tetsu Iwata and Jung Hee Cheon, editors, <i>Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 - December 3, 2015, Proceedings, Part II<\/i>, volume 9453 of <i>Lecture Notes in Computer Science<\/i>, pages 31\u201355. Springer, 2015.<\/p>","DOI":"10.1007\/978-3-662-48800-3_2"},{"key":"key-10.3934\/amc.2019028-7","doi-asserted-by":"publisher","DOI":"10.1112\/S1461157014000369"},{"key":"key-10.3934\/amc.2019028-8","doi-asserted-by":"crossref","unstructured":"<p>Y. Bistritz and A. Lifshitz, Bounds for resultants of univariate and bivariate polynomials, <i>Linear Algebra and its Applications<\/i>, <b>432<\/b> (2010), 1995\u20132005. Special issue devoted to the 15th ILAS Conference at Cancun, Mexico, June 16-20, 2008.<\/p>","DOI":"10.1016\/j.laa.2009.08.012"},{"key":"key-10.3934\/amc.2019028-9","doi-asserted-by":"crossref","unstructured":"<p>N. Gama and P. Q. Nguyen, Predicting lattice reduction, In Nigel Smart, editor, <i>Advances in Cryptology \u2013 EUROCRYPT 2008<\/i>, 31\u201351, Lecture Notes in Comput. Sci., 4965, Springer, Berlin, 2008.<\/p>","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"key-10.3934\/amc.2019028-10","doi-asserted-by":"publisher","DOI":"10.1112\/S1461157016000164"},{"key":"key-10.3934\/amc.2019028-11","doi-asserted-by":"publisher","DOI":"10.1137\/0406010"},{"key":"key-10.3934\/amc.2019028-12","unstructured":"<p>R. Granger, T. Kleinjung and J. Zumbr\u00e4gel, Discrete logarithms in GF(2<sup>9234<\/sup>), NMBRTHRY list, January 2014.<\/p>"},{"key":"key-10.3934\/amc.2019028-13","doi-asserted-by":"crossref","unstructured":"<p>A. Guillevic, Computing individual discrete logarithms faster in GF(<i>p<sup>n<\/sup><\/i>) with the NFS-DL algorithm, <i>Advances in cryptology\u2013ASIACRYPT 2015. Part I, <\/i>  149\u2013173, Lecture Notes in Comput. Sci., 9452, Springer, Heidelberg, 2015, <a href=\"http:\/\/eprint.iacr.org\/\" target=\"_blank\">http:\/\/eprint.iacr.org\/<\/a>.<\/p>","DOI":"10.1007\/978-3-662-48797-6_7"},{"key":"key-10.3934\/amc.2019028-14","doi-asserted-by":"crossref","unstructured":"<p>A. Guillevic, F. Morain and E. Thom&#233;, Solving discrete logarithms on a 170-bit MNT curve by pairing reduction, <i>Selected Areas in Cryptography \u2013 SAC 2016<\/i>, 2017,559\u2013578.  <a href=\"http:\/\/eprint.iacr.org\/\" target=\"_blank\">http:\/\/eprint.iacr.org\/<\/a>.<\/p>","DOI":"10.1007\/978-3-319-69453-5_30"},{"key":"key-10.3934\/amc.2019028-15","doi-asserted-by":"publisher","DOI":"10.14495\/jsiaml.6.53"},{"key":"key-10.3934\/amc.2019028-16","doi-asserted-by":"crossref","unstructured":"<p>A. Joux, Faster index calculus for the medium prime case: Application to 1175-bit and 1425-bit finite fields, In Thomas Johansson and Phong Q. Nguyen, editors, <i>EUROCRYPT<\/i>, volume 7881 of <i>Lecture Notes in Computer Science<\/i>, pages 177\u2013193. Springer, 2013.<\/p>","DOI":"10.1007\/978-3-642-38348-9_11"},{"key":"key-10.3934\/amc.2019028-17","unstructured":"<p>A. Joux, A new index calculus algorithm with complexity <inline-formula><tex-math id=\"M701\">$ L(1\/4+o(1)) $<\/tex-math><\/inline-formula> in small characteristic, In Tanja Lange, Kristin E. Lauter, and Petr Lisonek, editors, <i>Selected Areas in Cryptography - SAC 2013 - 20th International Conference, Burnaby, BC, Canada, August 14-16, 2013, Revised Selected Papers<\/i>, volume 8282 of <i>Lecture Notes in Computer Science<\/i>, pages 355\u2013379. Springer, 2014.<\/p>"},{"key":"key-10.3934\/amc.2019028-18","doi-asserted-by":"crossref","unstructured":"<p>A. Joux and R. Lercier, The function field sieve is quite special, In Claus Fieker and David R. Kohel, editors, <i>ANTS<\/i>, volume 2369 of <i>Lecture Notes in Computer Science<\/i>, pages 431\u2013445. Springer, 2002.<\/p>","DOI":"10.1007\/3-540-45455-1_34"},{"key":"key-10.3934\/amc.2019028-19","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-02-01482-5"},{"key":"key-10.3934\/amc.2019028-20","doi-asserted-by":"crossref","unstructured":"<p>A. Joux and R. Lercier, The function field sieve in the medium prime case, In Serge Vaudenay, editor, <i>EUROCRYPT<\/i>, volume 4004 of <i>Lecture Notes in Computer Science<\/i>, pages 254\u2013270. Springer, 2006.<\/p>","DOI":"10.1007\/11761679_16"},{"key":"key-10.3934\/amc.2019028-21","doi-asserted-by":"crossref","unstructured":"<p>A. Joux, R. Lercier, N. P. Smart and F. Vercauteren, The number field sieve in the medium prime case, In Cynthia Dwork, editor, <i>Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings<\/i>, volume 4117 of <i>Lecture Notes in Computer Science<\/i>, pages 326\u2013344. Springer Berlin Heidelberg, 2006.<\/p>","DOI":"10.1007\/11818175_19"},{"key":"key-10.3934\/amc.2019028-22","doi-asserted-by":"crossref","unstructured":"<p>A. Joux and C. Pierrot, The special number field sieve in <inline-formula><tex-math id=\"M702\">$ \\mathbb{F}_{p^n} $<\/tex-math><\/inline-formula> - Application to pairing-friendly constructions, In Zhenfu Cao and Fangguo Zhang, editors, <i>Pairing-Based Cryptography - Pairing 2013 - 6th International Conference, Beijing, China, November 22-24, 2013, Revised Selected Papers<\/i>, volume 8365 of <i>Lecture Notes in Computer Science<\/i>, pages 45\u201361. Springer, 2013.<\/p>","DOI":"10.1007\/978-3-319-04873-4_3"},{"key":"key-10.3934\/amc.2019028-23","doi-asserted-by":"crossref","unstructured":"<p>A. Joux and C. Pierrot, Improving the polynomial time precomputation of Frobenius representation discrete logarithm algorithms - simplified setting for small characteristic finite fields, In Palash Sarkar and Tetsu Iwata, editors, <i>Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I<\/i>, volume 8873 of <i>Lecture Notes in Computer Science<\/i>, pages 378\u2013397. Springer, 2014.<\/p>","DOI":"10.1007\/978-3-662-45611-8_20"},{"key":"key-10.3934\/amc.2019028-24","doi-asserted-by":"crossref","unstructured":"<p>T. Kim and R. Barbulescu, Extended tower number field sieve: A new complexity for the medium prime case, In Matthew Robshaw and Jonathan Katz, editors, <i>Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part I<\/i>, volume 9814 of <i>Lecture Notes in Computer Science<\/i>, pages 543\u2013571. Springer, 2016.<\/p>","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"key-10.3934\/amc.2019028-25","doi-asserted-by":"crossref","unstructured":"<p>T. Kim and J. Jeong, Extended tower number field sieve with application to finite fields of arbitrary composite extension degree, In Serge Fehr, editor, <i>Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part I<\/i>, volume 10174 of <i>Lecture Notes in Computer Science<\/i>, pages 388\u2013408. Springer, 2017.<\/p>","DOI":"10.1007\/978-3-662-54365-8_16"},{"key":"key-10.3934\/amc.2019028-26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"key-10.3934\/amc.2019028-27","doi-asserted-by":"crossref","unstructured":"<p>A. Menezes, P. Sarkar and S. Singh, Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography, In <i>Mycrypt<\/i>, volume 10311 of <i>Lecture Notes in Computer Science<\/i>, pages 83\u2013108. Springer, 2016.<\/p>","DOI":"10.1007\/978-3-319-61273-7_5"},{"key":"key-10.3934\/amc.2019028-28","doi-asserted-by":"crossref","unstructured":"<p>C. Pierrot, The multiple number field sieve with conjugation and generalized Joux-Lercier methods, In <i>Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I<\/i>, pages 156\u2013170, Lecture Notes in Comput. Sci., 9056, Springer, Heidelberg, 2015.<\/p>","DOI":"10.1007\/978-3-662-46800-5_7"},{"key":"key-10.3934\/amc.2019028-29","doi-asserted-by":"crossref","unstructured":"<p>P. Sarkar and S. Singh, Fine tuning the function field sieve algorithm for the medium prime case, <i>IEEE Transactions on Information Theory<\/i>, <b>62<\/b> (2016), 2233\u20132253. <a href=\"http:\/\/ieeexplore.ieee.org\/xpl\/articleDetails.jsp?reload=true&arnumber=7405328\" target=\"_blank\">http:\/\/ieeexplore.ieee.org\/xpl\/articleDetails.jsp?reload=true&arnumber=7405328<\/a>.<\/p>","DOI":"10.1109\/TIT.2016.2528996"},{"key":"key-10.3934\/amc.2019028-30","doi-asserted-by":"crossref","unstructured":"<p>P. Sarkar and S. Singh, A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm, In Jung Hee Cheon and Tsuyoshi Takagi, editors, <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I<\/i>, volume 10031 of <i>Lecture Notes in Computer Science<\/i>, pages 37\u201362, 2016.<\/p>","DOI":"10.1007\/978-3-662-53887-6_2"},{"key":"key-10.3934\/amc.2019028-31","doi-asserted-by":"crossref","unstructured":"<p>P. Sarkar and S. Singh, New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields, In Marc Fischlin and Jean-S\u00e9bastien Coron, editors, <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part I<\/i>, volume 9665 of <i>Lecture Notes in Computer Science<\/i>, pages 429\u2013458, Springer, 2016.<\/p>","DOI":"10.1007\/978-3-662-49890-3_17"},{"key":"key-10.3934\/amc.2019028-32","doi-asserted-by":"crossref","unstructured":"<p>O. Schirokauer, Discrete logarithms and local units, <i>Philosophical Transactions: Physical Sciences and Engineering<\/i>, <b>345<\/b> 91993), 409\u2013423.<\/p>","DOI":"10.1098\/rsta.1993.0139"},{"key":"key-10.3934\/amc.2019028-33","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-01137-0"},{"key":"key-10.3934\/amc.2019028-34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.11.004"},{"key":"key-10.3934\/amc.2019028-35","doi-asserted-by":"crossref","unstructured":"<p>D. H. Wiedemann, Solving sparse linear equations over finite fields, <i>IEEE Trans. Information Theory<\/i>, <b>32<\/b> (1986), 54\u201362.<\/p>","DOI":"10.1109\/TIT.1986.1057137"},{"key":"key-10.3934\/amc.2019028-36","doi-asserted-by":"publisher","DOI":"10.2478\/v10127-010-0012-y"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2019_3_435.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:01:41Z","timestamp":1772791301000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2019028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2019028","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}