{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T17:17:27Z","timestamp":1790788647021,"version":"4.1.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T00:00:00Z","timestamp":1693612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T00:00:00Z","timestamp":1693612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006021","name":"Direction G\u00e8n\u00e9rale de l\u2019Armement","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006021","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":[[2023,12]]},"DOI":"10.1007\/s10623-023-01282-w","type":"journal-article","created":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T11:01:57Z","timestamp":1693652517000},"page":"4059-4091","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Individual discrete logarithm with sublattice reduction"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2960-8231","authenticated-orcid":false,"given":"Haetham","family":"Al Aswad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C\u00e9cile","family":"Pierrot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,2]]},"reference":[{"key":"1282_CR1","unstructured":"Al Aswad, H., Pierrot, C.: Smoothness step in NFS for composite extenion finite fields. https:\/\/gitlab.inria.fr\/halaswad\/smoothing-step-in-nfs-for-composite-extension-degree-finite-fields. GitLab (2022)."},{"key":"1282_CR2","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. In: Kilian J. (ed.) CRYPTO 2001, vol. 2139, pp. 213\u2013229. LNCS. Springer, Heidelberg (2001).","DOI":"10.1007\/3-540-44647-8_13"},{"key":"1282_CR3","first-page":"5","volume":"6","author":"I Blake","year":"1984","unstructured":"Blake I., Fuji-Hara R., Mullin R., Vanstone S.: Computing logarithms in finite fields of characteristic two. Siam J. Algebraic Discret. Methods 6, 5 (1984).","journal-title":"Siam J. Algebraic Discret. Methods"},{"key":"1282_CR4","doi-asserted-by":"crossref","unstructured":"Boudot, F., Gaudry, P., Guillevic, A., Heninger, N., Thom\u00e9, E., Zimmermann, P.: Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2020, pp. 62\u201391. Part II, LNCS. Springer, Heidelberg (2020).","DOI":"10.1007\/978-3-030-56880-1_3"},{"key":"1282_CR5","unstructured":"Barbulescu, R., Gaudry, P., Guillevic, A., Morain, F.: DL record computation in $$\\mathbb{F}_{p^4}$$ of $$392$$ bits. http:\/\/www.lix.polytechnique.fr\/~guillevic\/docs\/guillevic-catrel15-talk.pdf (2015)."},{"key":"1282_CR6","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: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, pp. 129\u2013155. Part I, volume 9056 of LNCS. Springer, Heidelberg (2015).","DOI":"10.1007\/978-3-662-46800-5_6"},{"key":"1282_CR7","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: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014, vol. 8441, pp. 1\u201316. LNCS. Springer, Heidelberg (2014).","DOI":"10.1007\/978-3-642-55220-5_1"},{"key":"1282_CR8","doi-asserted-by":"crossref","unstructured":"Barbulescu, R.G., Pierrick, K.T.: The tower number field sieve. In: Tetsu, I., Jung, H.C. (eds.), ASIACRYPT\u00a02015, Part\u00a0II, volume 9453 of LNCS, pp. 31\u201355. Springer, Heidelberg (2015).","DOI":"10.1007\/978-3-662-48800-3_2"},{"key":"1282_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001, vol. 2248, pp. 514\u2013532. LNCS. Springer, Heidelberg (2001).","DOI":"10.1007\/3-540-45682-1_30"},{"key":"1282_CR10","doi-asserted-by":"crossref","unstructured":"Blake, I.F., Mullin, R.C., Vanstone, S.A.: Computing logarithms in $$\\text{GF}(2^n)$$. In: Blakley, G.R., David C. (eds.) CRYPTO\u201984, volume 196 of LNCS, pp. 73\u201382. Springer, Heidelberg (1984).","DOI":"10.1007\/3-540-39568-7_8"},{"key":"1282_CR11","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/S1461157014000369","volume":"17","author":"Razvan Barbulescu","year":"2014","unstructured":"Barbulescu Razvan, Pierrot C\u00e9cile.: The multiple number field sieve for medium and high characteristic finite fields. LMS J. Comput. Math. 17, 230\u2013246 (2014).","journal-title":"LMS J. Comput. Math."},{"issue":"1","key":"1282_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","volume":"17","author":"ER Canfield","year":"1983","unstructured":"Canfield E.R., Erd\u00f6s P., Pomerance C.: On a problem of Oppenheim concerning \u201cfactorisatio numerorum\u2019\u2019. J. Number Theory 17(1), 1\u201328 (1983).","journal-title":"J. Number Theory"},{"key":"1282_CR13","doi-asserted-by":"crossref","unstructured":"De Micheli, G., Gaudry, P., Pierrot, C.: Lattice enumeration for tower NFS: A 521-bit discrete logarithm computation. In Mehdi, T., Huaxiong, W. (ed.) Advances in Cryptology-ASIACRYPT 2021-27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6\u201310, 2021, Proceedings, Part I, volume 13090 ofLecture Notes in Computer Science, pp. 67\u201396. Springer (2021).","DOI":"10.1007\/978-3-030-92062-3_3"},{"key":"1282_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","volume":"8","author":"U Fincke","year":"1985","unstructured":"Fincke U., Pohst M.E.: Improved methods for calculating vectors of short length in a lattice. Math. Comput. 8, 463\u2013471 (1985).","journal-title":"Math. Comput."},{"key":"1282_CR15","doi-asserted-by":"crossref","unstructured":"Granger, R., Kleinjung, T., Zumbr\u00e4gel J.: Breaking \u2018128-bit secure\u2019 supersingular binary curves - (or how to solve discrete logarithms in $$\\mathbb{F} _{2^{4 \\cdot 1223}}$$ and $$\\mathbb{F} _{2^{12 \\cdot 367}}$$). In: Garay, J.A., Gennaro, R, (eds.) CRYPTO 2014, pp. 126\u2013145. Part II, volume 8617 of LNCS. Springer, Heidelberg (2014).","DOI":"10.1007\/978-3-662-44381-1_8"},{"key":"1282_CR16","unstructured":"Gr\u00e9my, L.: Computations of discrete logarithms sorted by date. https:\/\/dldb.loria.fr\/."},{"issue":"1","key":"1282_CR17","first-page":"39","volume":"1","author":"Aurore Guillevic","year":"2021","unstructured":"Guillevic Aurore, Singh Shashank: On the alpha value of polynomials in the tower number field sieve algorithm. Math. Cryptol. 1(1), 39 (2021).","journal-title":"Math. Cryptol."},{"key":"1282_CR18","doi-asserted-by":"crossref","unstructured":"Guillevic, A.: Computing individual discrete logarithms faster in $$\\text{ GF }(p^n)$$ with the NFS-DL algorithm. In: Tetsu, I., Jung\u00a0H.C. (eds.) ASIACRYPT\u00a02015, Part\u00a0I, volume 9452 of LNCS, pp 149\u2013173. Springer, Heidelberg (2015).","DOI":"10.1007\/978-3-662-48797-6_7"},{"issue":"317","key":"1282_CR19","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1090\/mcom\/3376","volume":"88","author":"Aurore Guillevic","year":"2019","unstructured":"Guillevic Aurore: Faster individual discrete logarithms in finite fields of composite extension degree. Math. Comput. 88(317), 1273\u20131301 (2019).","journal-title":"Math. Comput."},{"key":"1282_CR20","doi-asserted-by":"crossref","unstructured":"Hanrot, G., Pujol X., Stehl\u00e9 D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Rogaway, P. (ed.) CRYPTO 2011, vol. 6841, pp. 447\u2013464. LNCS. Springer, Heidelberg (2011).","DOI":"10.1007\/978-3-642-22792-9_25"},{"key":"1282_CR21","doi-asserted-by":"crossref","unstructured":"Joux, A., Lercier, R., Smart, N., Vercauteren, F.: The number field sieve in the medium prime case. In: Dwork, C. (ed.) CRYPTO 2006, vol. 4117, pp. 326\u2013344. LNCS. Springer, Heidelberg (2006).","DOI":"10.1007\/11818175_19"},{"issue":"4","key":"1282_CR22","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"Antoine Joux","year":"2004","unstructured":"Joux Antoine: A one round protocol for tripartite Diffie\u2013Hellman. J. Cryptol. 17(4), 263\u2013276 (2004).","journal-title":"J. Cryptol."},{"key":"1282_CR23","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: Cao, Z., Zhang, F. (eds.) PAIRING 2013, vol. 8365, pp. 45\u201361. LNCS. Springer, Heidelberg (2014).","DOI":"10.1007\/978-3-319-04873-4_3"},{"issue":"3","key":"1282_CR24","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"Ravi Kannan","year":"1987","unstructured":"Kannan Ravi: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987).","journal-title":"Math. Oper. Res."},{"key":"1282_CR25","doi-asserted-by":"crossref","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, pp. 543\u2013571. Part I, volume 9814 of LNCS. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"1282_CR26","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: Fehr, S. (ed.) PKC 2017, pp. 388\u2013408. Part I, volume 10174 of LNCS. Springer, Heidelberg (2017).","DOI":"10.1007\/978-3-662-54365-8_16"},{"key":"1282_CR27","unstructured":"Thorsten, K., Benjamin, W.: Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. Cryptology ePrint Archive, Report 2019\/751. https:\/\/eprint.iacr.org\/2019\/751 (2019)."},{"key":"1282_CR28","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., Lovasz L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"1282_CR29","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"Victor Miller","year":"2004","unstructured":"Miller Victor: The weil pairing, and its efficient calculation. J. Cryptol. 17, 235\u2013261 (2004).","journal-title":"J. Cryptol."},{"key":"1282_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2019.101629","volume":"62","author":"M Mukhopadhyay","year":"2020","unstructured":"Mukhopadhyay M., Sarkar P.: Faster initial splitting for small characteristic composite extension degree fields. Finite Fields Their Appl. 62, 101629 (2020).","journal-title":"Finite Fields Their Appl."},{"issue":"3","key":"1282_CR31","doi-asserted-by":"publisher","first-page":"449","DOI":"10.3934\/amc.2020119","volume":"16","author":"M Mukhopadhyay","year":"2022","unstructured":"Mukhopadhyay M., Sarkar P., Singh S., Thom\u00e9 E.: New discrete logarithm computation for the medium prime case using the function field sieve. Adv. Math. Commun. 16(3), 449\u2013464 (2022).","journal-title":"Adv. Math. Commun."},{"key":"1282_CR32","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P..: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. In: Schulman, L.J. (ed.), 42nd ACM STOC, pp. 351\u2013358. ACM Press (2010).","DOI":"10.1145\/1806689.1806739"},{"key":"1282_CR33","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Walter, M.: Fast lattice point enumeration with minimal overhead. In: P. Indyk (ed.), 26th SODA, pp. 276\u2013294. ACM-SIAM (2015).","DOI":"10.1137\/1.9781611973730.21"},{"key":"1282_CR34","doi-asserted-by":"crossref","unstructured":"Micciancio, D.,, Walter, M.,: Practical, predictable lattice basis reduction. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, pp. 820\u2013849. Part I, volume 9665 of LNCS. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-49890-3_31"},{"key":"1282_CR35","doi-asserted-by":"crossref","unstructured":"Pierrot, C.: The multiple number field sieve with conjugation and generalized Joux\u2013Lercier methods. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, pp. 156\u2013170. Part I, volume 9056 of LNCS. Springer, Heidelberg (2015).","DOI":"10.1007\/978-3-662-46800-5_7"},{"key":"1282_CR36","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, 1267\u20131283 (2000).","journal-title":"Math. Comput."},{"key":"1282_CR37","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"S Claus-Peter","year":"1994","unstructured":"Claus-Peter S., Euchner M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994).","journal-title":"Math. Program."},{"key":"1282_CR38","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Singh, S.: A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm. In: Jung\u00a0H.C., Tsuyoshi T. (eds.), ASIACRYPT\u00a02016, Part\u00a0I, volume 10031 of LNCS, pp. 37\u201362. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-53887-6_2"},{"key":"1282_CR39","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Singh, S.: A unified polynomial selection method for the (tower) number field sieve algorithm (2019).","DOI":"10.3934\/amc.2019028"},{"key":"1282_CR40","unstructured":"Trusted platform module. https:\/\/trustedcomputinggroup.org\/resource\/tpm-library-specification\/. Latest Version (2019)."},{"issue":"1","key":"1282_CR41","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"DH Wiedemann","year":"1986","unstructured":"Wiedemann D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Inform. Theory 32(1), 54\u201362 (1986).","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01282-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01282-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01282-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T08:05:18Z","timestamp":1699085118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01282-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,2]]},"references-count":41,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1282"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01282-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,2]]},"assertion":[{"value":"27 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2023","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 they have no financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflictof interest"}}]}}