{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:58:46Z","timestamp":1760061526134},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642155819"},{"type":"electronic","value":"9783642155826"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15582-6_17","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T05:15:44Z","timestamp":1284095744000},"page":"84-87","source":"Crossref","is-referenced-by-count":44,"title":["FGb: A Library for Computing Gr\u00f6bner Bases"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Innsbruck (1965)"},{"key":"17_CR2","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":"17_CR3","first-page":"1","volume-title":"ACM Proceedings of The International Workshop on Parallel and Symbolic Computation (PASCO)","author":"J.-C. Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Lachartre, S.: Parallel Gaussian Elimination for Gr\u00f6bner bases computations in finite fields. In: Moreno-Maza, M., Roch, J.L. (eds.) ACM Proceedings of The International Workshop on Parallel and Symbolic Computation (PASCO), LIG, pp. 1\u201310. ACM, New York (July 2010)"},{"key":"17_CR4","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":"17_CR5","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":"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: Eurocrypt 2010. LNCS, vol.\u00a06110, pp. 279\u2013298. Springer, Heidelberg (2010)"},{"key":"17_CR6","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","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, pp. 151\u2013158. ACM, New York (2009)"},{"key":"17_CR7","unstructured":"Faug\u00e8re, J.C.: FGb library for comptuing Gr\u00f6bner bases, \n                    \n                      http:\/\/www-salsa.lip6.fr\/~jcf\/Software\/FGb\/"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/11818175_21","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J.-C. Faug\u00e8re","year":"2006","unstructured":"Faug\u00e8re, J.-C., Perret, L.: Cryptanalysis of 2R\u2013 schemes. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 357\u2013372. Springer, Heidelberg (2006)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11761679_3","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J.-C. Faug\u00e8re","year":"2006","unstructured":"Faug\u00e8re, J.-C., Perret, L.: Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 30\u201347. Springer, Heidelberg (2006)"},{"issue":"1-3","key":"17_CR10","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 bases (F4). Journal of Pure and Applied Algebra\u00a0139(1-3), 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"17_CR11","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","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: Mora, T. (ed.) Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp. 75\u201383. ACM Press, New York (July 2002)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C., Gianni, P., Lazard, D., Mora, T.: Efficient Computation of Zero-Dimensional Gr\u00f6bner Basis by Change of Ordering\u00a016(4), 329\u2013344 (October 1993)","DOI":"10.1006\/jsco.1993.1051"},{"key":"17_CR13","unstructured":"Lecerf, G.: Kronecker Magma package for solving polynomial systems by means of geometric resolutions, \n                    \n                      http:\/\/www.math.uvsq.fr\/~lecerf\/software\/"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15582-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:02:13Z","timestamp":1558288933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15582-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642155819","9783642155826"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15582-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}