{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:19:27Z","timestamp":1742915967483,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041020"},{"type":"electronic","value":"9783642041037"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04103-7_7","type":"book-chapter","created":{"date-parts":[[2009,9,30]],"date-time":"2009-09-30T05:41:17Z","timestamp":1254289277000},"page":"79-80","source":"Crossref","is-referenced-by-count":0,"title":["Solving Structured Polynomial Systems and Applications to Cryptology"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"The Design of Rijndael: The Wide Trail Strategy","author":"J. Daemen","year":"2001","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael: The Wide Trail Strategy. Springer, Heidelberg (2001)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: An Algorithm for Finding the Basis Elements in the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal (German), PhD Thesis, Univ of Innsbruck, Math. Institute, Austria, English Translation: J. of Symbolic Computation, Special Issue on Logic, Math and Comp Science: Interactions\u00a041(3-4), 475-511 (1965)","DOI":"10.1016\/j.jsc.2005.09.007"},{"key":"7_CR3","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic Behaviour of the Degree of Regularity of Semi-Regular Polynomial Systems. In: Proc. of MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry (2005)"},{"key":"7_CR4","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.B.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45682-1_24","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"N. Courtois","year":"2001","unstructured":"Courtois, N.: Efficient Zero-knowledge Authentication Based on a Linear Algebra Problem MinRank. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, p. 402. Springer, Heidelberg (2001)"},{"key":"7_CR6","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":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"7_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"Proceedings of ISSAC","author":"J.-C. Faug\u00e8re","year":"2002","unstructured":"Faug\u00e8re, J.-C.: A New Efficient Algorithm for Computing Gr\u00f6bner Basis without Reduction to Zero: F5. In: Proceedings of ISSAC, July 2002, pp. 75\u201383. ACM press, New York (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04103-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T23:36:46Z","timestamp":1685144206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04103-7_7"}},"subtitle":["(Plenary Talk)"],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041020","9783642041037"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04103-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}