{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:57:54Z","timestamp":1772283474265,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642290107","type":"print"},{"value":"9783642290114","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29011-4_4","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T07:05:53Z","timestamp":1333609553000},"page":"27-44","source":"Crossref","is-referenced-by-count":37,"title":["Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"first","affiliation":[]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Petit","sequence":"additional","affiliation":[]},{"given":"Gu\u00e9na\u00ebl","family":"Renault","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/SFCS.1979.2","volume-title":"Proceedings of the 20th Annual Symposium on Foundations of Computer Science, SFCS 1979","author":"L.M. Adleman","year":"1979","unstructured":"Adleman, L.M.: A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, SFCS 1979, pp. 55\u201360. IEEE Computer Society, Washington, DC, USA (1979)"},{"key":"4_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)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/3-540-58691-1_39","volume-title":"Algorithmic Number Theory","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M., DeMarrais, J., Huang, M.: A Subexponential Algorithm for Discrete Logarithms over the Rational Subgroup of the Jacobians of Large Genus Hyperelliptic Curves over Finite Fields. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 28\u201340. Springer, Heidelberg (1994)"},{"issue":"1-2","key":"4_CR4","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.: Function Field Sieve Method for Discrete Logarithms over Finite Fields. Inform. and Comput.\u00a0151(1-2), 5\u201316 (1999)","journal-title":"Inform. and Comput."},{"key":"4_CR5","unstructured":"Bardet, M.: \u00c9tude des Syst\u00e8mes Alg\u00e9briques Surd\u00e9termin\u00e9s. Applications aux codes Correcteurs et \u00e0 la Cryptographie. PhD thesis, Universit\u00e9 Paris VI (2004)"},{"key":"4_CR6","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B.: Complexity of Gr\u00f6bner Basis Computation for Semi-Regular Overdetermined Sequences over F 2 with Solutions in F 2. Technical Report 5049, INRIA (December 2003), http:\/\/www.inria.fr\/rrrt\/rr-5049.html"},{"key":"4_CR7","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic Expansion of the Degree of Regularity for Semi-Regular Systems of Equations. In: Gianni, P. (ed.) The Effective Methods in Algebraic Geometry Conference, Mega 2005, pp. 1\u201314 (May 2005)"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1515\/JMC.2009.009","volume":"3","author":"L. Bettale","year":"2010","unstructured":"Bettale, L., Faug\u00e8re, J.-C., Perret, L.: Hybrid Approach for Solving Multivariate Systems over Finite Fields. Journal of Math. Cryptology\u00a03(3), 177\u2013197 (2010)","journal-title":"Journal of Math. Cryptology"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Bettale, L., Faug\u00e8re, J.-C., Perret, L.: Cryptanalysis of HFE, multi-HFE and Variants for Odd and Even Characteristic. Des. Codes Cryptography, 1\u201346 (2012)","DOI":"10.1007\/s10623-012-9617-2"},{"key":"4_CR10","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Universit\u00e4t Innsbruck (1965)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, H., Frey, G. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and its Applications. Chapman & Hall\/CRC (2005)","DOI":"10.1201\/9781420034981"},{"issue":"4","key":"4_CR12","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/TIT.1984.1056941","volume":"30","author":"D. Coppersmith","year":"1984","unstructured":"Coppersmith, D.: Fast Evaluation of Logarithms in Fields of Characteristic Two. IEEE Transactions on Information Theory\u00a030(4), 587\u2013593 (1984)","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1112\/S0010437X10005075","volume":"147","author":"C. Diem","year":"2011","unstructured":"Diem, C.: On the Discrete Logarithm Problem in Elliptic Curves. Compositio Mathematica\u00a0147, 75\u2013104 (2011)","journal-title":"Compositio Mathematica"},{"key":"4_CR14","unstructured":"Diem, C.: On the Discrete Logarithm Problem in Elliptic Curves II. Presented at ECC 2011 (2011), http:\/\/www.math.uni-leipzig.de\/diem\/preprints\/dlp-ell-curves-II.pdf"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.4064\/aa102-1-6","volume":"102","author":"A. Enge","year":"2002","unstructured":"Enge, A., Gaudry, P.: A General Framework for Subexponential Discrete Logarithm Algorithms. Acta Arith.\u00a0102(1), 83\u2013103 (2002)","journal-title":"Acta Arith."},{"issue":"1-3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.-C.: A New Efficient Algorithm for Computing Gr\u00f6bner Basis (F4). Journal of Pure and Applied Algebra\u00a0139(1-3), 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC 2002","author":"J.-C. Faug\u00e8re","year":"2002","unstructured":"Faug\u00e8re, J.-C.: A New Efficient Algorithm for Computing Gr\u00f6bner Bases without Reduction to Zero (F5). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC 2002, pp. 75\u201383. ACM, New York (2002)"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-45146-4_3","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J.-C. Faug\u00e8re","year":"2003","unstructured":"Faug\u00e8re, J.-C., Joux, A.: Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gr\u00f6bner Bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 44\u201360. Springer, Heidelberg (2003)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13190-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J.-C. Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic Cryptanalysis of McEliece Variants with Compact Keys. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 279\u2013298. Springer, Heidelberg (2010)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-15582-6_17","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"J.-C. Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C.: FGb: A Library for Computing Gr\u00f6bner Bases. In: Fukuda, K., van der Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol.\u00a06327, pp. 84\u201387. Springer, Heidelberg (2010)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/978-3-540-85174-5_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J.-C. Faug\u00e8re","year":"2008","unstructured":"Faug\u00e8re, J.-C., Levy-dit-Vehel, F., Perret, L.: Cryptanalysis of MinRank. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 280\u2013296. Springer, Heidelberg (2008)"},{"key":"4_CR22","unstructured":"Faug\u00e8re, J.-C., Perret, L., Petit, C., Renault, G.: New Subexponential Algorithms for Factoring in $SL(2,\\mathbb{F}_2^n)$ . Preprint (2011)"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1145\/1837934.1837984","volume-title":"ISSAC 2010: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010","author":"J.-C. Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Safey El Din, M., Spaenlehauer, P.-J.: Computing Loci of Rank Defects of Linear Matrices using Gr\u00f6bner Bases and Applications to Cryptology. In: ISSAC 2010: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010, pp. 257\u2013264. ACM, New York (2010)"},{"issue":"4","key":"4_CR24","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jsc.2010.10.014","volume":"46","author":"J.-C. Faug\u00e8re","year":"2011","unstructured":"Faug\u00e8re, J.-C., Safey El Din, M., Spaenlehauer, P.-J.: Gr\u00f6bner Bases of Bihomogeneous Ideals Generated by Polynomials of Bidegree (1,1): Algorithms and Complexity. Journal of Symbolic Computation\u00a046(4), 406\u2013437 (2011)","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/1576702.1576725","volume-title":"ISSAC 2009: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, ISSAC 2009","author":"J.-C. Faug\u00e8re","year":"2009","unstructured":"Faug\u00e8re, J.-C., Rahmany, S.: Solving Systems of Polynomial Equations with Symmetries using SAGBI-Gr\u00f6bner bases. In: ISSAC 2009: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, ISSAC 2009, pp. 151\u2013158. ACM, New York (2009)"},{"issue":"257","key":"4_CR26","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1090\/S0025-5718-06-01900-4","volume":"76","author":"P. Gaudry","year":"2007","unstructured":"Gaudry, P., Thom\u00e9, E., Th\u00e9riault, N., Diem, C.: A Double Large Prime Variation for Small Genus Hyperelliptic Index Calculus. Math. Comp.\u00a076(257), 475\u2013492 (electronic) (2007)","journal-title":"Math. Comp."},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-45539-6_2","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"P. Gaudry","year":"2000","unstructured":"Gaudry, P.: An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 19\u201334. Springer, Heidelberg (2000)"},{"issue":"12","key":"4_CR28","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.jsc.2008.08.005","volume":"44","author":"P. Gaudry","year":"2009","unstructured":"Gaudry, P.: Index Calculus for Abelian Varieties of Small Simension and the Elliptic Curve Discrete Logarithm Problem. J. Symb. Comput.\u00a044(12), 1690\u20131702 (2009)","journal-title":"J. Symb. Comput."},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/11818175_20","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"L. Granboulan","year":"2006","unstructured":"Granboulan, L., Joux, A., Stern, J.: Inverting HFE Is Quasipolynomial. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 345\u2013356. Springer, Heidelberg (2006)"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11761679_16","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"A. Joux","year":"2006","unstructured":"Joux, A., Lercier, R.: The Function Field Sieve in the Medium Prime Case. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 254\u2013270. Springer, Heidelberg (2006)"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"A. Kipnis","year":"1999","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 19\u201330. Springer, Heidelberg (1999)"},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic Curve Cryptosystems. Mathematics of Computation\u00a048, 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"key":"4_CR33","unstructured":"Kraitchik, M.: Th\u00e9orie des Nombres. Gauthier\u2013Villards (1922)"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-12868-9_99","volume-title":"Computer Algebra","author":"D. Lazard","year":"1983","unstructured":"Lazard, D.: Gr\u00f6bner-Bases, Gaussian Elimination and Resolution of Systems of Algebraic Equations. In: van Hulzen, J.A. (ed.) EUROCAL 1983. LNCS, vol.\u00a0162, pp. 146\u2013156. Springer, Heidelberg (1983)"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Macaulay, F.S.: The Algebraic Theory of Modular Systems. Cambridge Mathematical Library, vol.\u00a0xxxi. Cambridge University Press (1916)","DOI":"10.3792\/chmm\/1263317740"},{"key":"4_CR36","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1112\/plms\/s2-26.1.531","volume":"26","author":"F.S. Macaulay","year":"1927","unstructured":"Macaulay, F.S.: Some Properties of Enumeration in the Theory of Modular Systems. Proc. London Math. Soc.\u00a026, 531\u2013555 (1927)","journal-title":"Proc. London Math. Soc."},{"key":"4_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"J. Patarin","year":"1996","unstructured":"Patarin, J.: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 33\u201348. Springer, Heidelberg (1996)"},{"key":"4_CR39","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/jsco.1998.0271","volume":"28","author":"J.M. Rojas","year":"1999","unstructured":"Rojas, J.M.: Solving Degenerate Sparse Polynomial Systems Faster. J. Symbolic Computation\u00a028, 155\u2013186 (1999)","journal-title":"J. Symbolic Computation"},{"key":"4_CR40","unstructured":"Semaev, I.: Summation Polynomials and the Discrete Logarithm Problem on Elliptic Curves (2004), http:\/\/eprint.iacr.org\/2004\/031.pdf"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29011-4_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T19:42:58Z","timestamp":1687376578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29011-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290107","9783642290114"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29011-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}