{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:49Z","timestamp":1772283649758,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642546303","type":"print"},{"value":"9783642546310","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54631-0_13","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T10:04:17Z","timestamp":1392890657000},"page":"221-238","source":"Crossref","is-referenced-by-count":13,"title":["Discrete Logarithm in GF(2809) with FFS"],"prefix":"10.1007","author":[{"given":"Razvan","family":"Barbulescu","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Bouvier","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00e9mie","family":"Detrey","sequence":"additional","affiliation":[]},{"given":"Pierrick","family":"Gaudry","sequence":"additional","affiliation":[]},{"given":"Hamza","family":"Jeljeli","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"Thom\u00e9","sequence":"additional","affiliation":[]},{"given":"Marion","family":"Videau","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Adj, G., Menezes, A., Oliveira, T., Rodr\u00edguez-Henr\u00edquez, F.: Weakness of $\\mathbb{F}_{3^{6*509}}$ for discrete logarithm cryptography, preprint, 24 pages (2013), http:\/\/eprint.iacr.org\/2013\/446"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-58691-1_48","volume-title":"Algorithmic Number Theory","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M.: The function field sieve. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 108\u2013121. Springer, Heidelberg (1994)"},{"issue":"1-2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1006\/inco.1998.2761","volume":"151","author":"L.M. Adleman","year":"1999","unstructured":"Adleman, L.M., Huang, M.D.A.: Function field sieve method for discrete logarithms over finite fields. Inf. Comput.\u00a0151(1-2), 5\u201316 (1999)","journal-title":"Inf. Comput."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-76900-2_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"K. Aoki","year":"2007","unstructured":"Aoki, K., Franke, J., Kleinjung, T., Lenstra, A.K., Osvik, D.A.: A kilobit special number field sieve factorization. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 1\u201312. Springer, Heidelberg (2007)"},{"key":"13_CR5","unstructured":"Bai, S., Bouvier, C., Filbois, A., Gaudry, P., Imbert, L., Kruppa, A., Morain, F., Thom\u00e9, E., Zimmermann, P.: CADO-NFS, an implementation of the number field sieve algorithm (2013), development version http:\/\/cado-nfs.gforge.inria.fr\/"},{"key":"13_CR6","unstructured":"Bai, S., Filbois, A., Gaudry, P., Kruppa, A., Morain, F., Thom\u00e9, E., Zimmermann, P.: CADO-NFS, Crible Alg\u00e9brique: Distribution, Optimisation - Number Field Sieve, http:\/\/cado-nfs.gforge.inria.fr\/"},{"key":"13_CR7","unstructured":"Barbulescu, R.: Selecting polynomials for the Function Field Sieve. 23 pages (2013), http:\/\/hal.inria.fr\/hal-00798386 (preprint)"},{"key":"13_CR8","unstructured":"Barbulescu, R., Bouvier, C., Detrey, J., Gaudry, P., Jeljeli, H., Thom\u00e9, E., Videau, M., Zimmermann, P.: The relationship between some guy and cryptography, ECC 2012, rump session talk (humoristic) (2012), http:\/\/ecc.rump.cr.yp.to\/"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Barbulescu, R., Gaudry, P., Joux, A., Thom\u00e9, E.: A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic, 8 pages (2013), http:\/\/hal.inria.fr\/hal-00835446 (preprint)","DOI":"10.1007\/978-3-642-55220-5_1"},{"key":"13_CR10","unstructured":"Bouvier, C.: The filtering step of discrete logarithm and integer factorization algorithms, 22 pages (2013), http:\/\/hal.inria.fr\/hal-00734654 (preprint)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Detrey, J., Gaudry, P., Videau, M.: Relation collection for the Function Field Sieve. In: Nannarelli, A., Seidel, P.M., Tang, P.T.P. (eds.) Proceedings of ARITH-21, pp. 201\u2013210. IEEE (2013)","DOI":"10.1109\/ARITH.2013.28"},{"issue":"6","key":"13_CR12","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 Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"13_CR13","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 Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24847-7_16","volume-title":"Algorithmic Number Theory","author":"R. Granger","year":"2004","unstructured":"Granger, R., Holt, A.J., Page, D.L., Smart, N.P., Vercauteren, F.: Function field sieve in characteristic three. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol.\u00a03076, pp. 223\u2013234. Springer, Heidelberg (2004)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-34961-4_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"T. Hayashi","year":"2012","unstructured":"Hayashi, T., Shimoyama, T., Shinohara, N., Takagi, T.: Breaking pairing-based cryptosystems using \u03b7 T pairing over GF(397). In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 43\u201360. 7658, Heidelberg (2012)"},{"key":"13_CR16","unstructured":"Jeljeli, H.: Accelerating iterative SpMV for Discrete Logarithm Problem using GPUs, 11 pages (2013), http:\/\/hal.inria.fr\/hal-00734975 (preprint)"},{"key":"13_CR17","unstructured":"Joux, A., Lercier, R.: Discrete logarithms in GF(2n) (521 bits), email to the NMBRTHRY mailing list (September 2001), http:\/\/listserv.nodak.edu\/archives\/nmbrthry.html"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45455-1_34","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2002","unstructured":"Joux, A., Lercier, R.: The function field sieve is quite special. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 431\u2013445. Springer, Heidelberg (2002)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Joux, A.: A new index calculus algorithm with complexity L(1\/4 + o(1)) in very small characteristic, To appear in Selected Areas in Cryptography, 12 pages (2013), http:\/\/eprint.iacr.org\/2013\/095 (preprint)","DOI":"10.1007\/978-3-662-43414-7_18"},{"issue":"242","key":"13_CR20","first-page":"953","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\u00a072(242), 953\u2013967 (2003)","journal-title":"A Comparison with the Gaussian Integer Method"},{"key":"13_CR21","unstructured":"Joux, A., Lercier, R.: Discrete logarithms in GF(2607) and GF(2613). E-mail to the NMBRTHRY mailing list (September 2005), http:\/\/listserv.nodak.edu\/archives\/nmbrthry.html"},{"issue":"210","key":"13_CR22","first-page":"777","volume":"64","author":"E. Kaltofen","year":"1995","unstructured":"Kaltofen, E.: Analysis of Coppersmith\u2019s block Wiedemann algorithm for the parallel solution of sparse linear systems. Mathematics of Computation\u00a064(210), 777\u2013806 (1995)","journal-title":"Mathematics of Computation"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-14623-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"T. Kleinjung","year":"2010","unstructured":"Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thom\u00e9, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-bit RSA modulus. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 333\u2013350. Springer, Heidelberg (2010)"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-642-42001-6_9","volume-title":"Number Theory and Cryptography","author":"A.K. Lenstra","year":"2013","unstructured":"Lenstra, A.K., Kleinjung, T., Thom\u00e9, E.: Universal security. In: Fischlin, M., Katzenbeisser, S. (eds.) Buchmann Festschrift. LNCS, vol.\u00a08260, pp. 121\u2013124. Springer, Heidelberg (2013)"},{"key":"13_CR25","unstructured":"Matsumoto, R.: Using C ab curves in the function field sieve. IEICE Trans. Fund. E82-A(3), 551\u2013552 (1999)"},{"key":"13_CR26","unstructured":"Murphy, B.A.: Polynomial selection for the number field sieve integer factorisation algorithm. Phd thesis, Australian National University (1999)"},{"key":"13_CR27","unstructured":"National Institute of Standards and Technology: Digital signature standard, DSS (2013), http:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.186-4.pdf"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54631-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T22:05:20Z","timestamp":1746137120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54631-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642546303","9783642546310"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54631-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}