{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T20:54:11Z","timestamp":1773262451005,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642130120","type":"print"},{"value":"9783642130137","type":"electronic"}],"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-13013-7_3","type":"book-chapter","created":{"date-parts":[[2010,5,14]],"date-time":"2010-05-14T02:18:57Z","timestamp":1273803537000},"page":"35-52","source":"Crossref","is-referenced-by-count":10,"title":["Algebraic Cryptanalysis of the PKC\u20192009 Algebraic Surface Cryptosystem"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"first","affiliation":[]},{"given":"Pierre-Jean","family":"Spaenlehauer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Adams, W.W., Loustaunau, P.: An introduction to Gr\u00f6bner bases. American Mathematical Society (1994)","DOI":"10.1090\/gsm\/003"},{"issue":"421","key":"3_CR2","first-page":"13","volume":"104","author":"K. Akiyama","year":"2004","unstructured":"Akiyama, K., Goto, Y.: An Algebraic Surface Public-key Cryptosystem. IEIC Technical Report (Institute of Electronics, Information and Communication Engineers)\u00a0104(421), 13\u201320 (2004)","journal-title":"IEIC Technical Report (Institute of Electronics, Information and Communication Engineers)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","first-page":"442","volume-title":"PKC 2009","author":"K. Akiyama","year":"2009","unstructured":"Akiyama, K., Goto, Y., Miyake, H.: An Algebraic Surface Cryptosystem. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, p. 442. Springer, Heidelberg (2009)"},{"key":"3_CR4","unstructured":"Bardet, M., Faugere, J.-C., Salvy, B.: On the complexity of Gr\u00f6bner basis computation of semi-regular overdetermined algebraic equations. In: Proceedings of the International Conference on Polynomial System Solving, pp. 71\u201374 (2004)"},{"key":"3_CR5","unstructured":"Bardet, M., Faugere, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In: Proceedings of the Eight International Symposium on Effective Methods in Algebraic Geometry, MEGA (2005)"},{"key":"3_CR6","volume-title":"Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra","author":"D.A. Cox","year":"1997","unstructured":"Cox, D.A., Little, J.B., O\u2019Shea, D.: Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer, Heidelberg (1997)"},{"key":"3_CR7","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, 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"3_CR8","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: Proceedings of the 2002 international symposium on symbolic and algebraic computation, pp. 75\u201383. ACM, New York (2002)"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J.-C. Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J.-C., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. Journal of Symbolic Computation\u00a016(4), 329\u2013344 (1993)","journal-title":"Journal of Symbolic Computation"},{"key":"3_CR10","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.S., et al.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, San Francisco (1979)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Ivanov, P., Voloch, J.F.: Breaking the Akiyama-Goto cryptosystem. Arithmetic, Geometry, Cryptography and Coding Theory\u00a0487 (2009)","DOI":"10.1090\/conm\/487\/09528"},{"key":"3_CR12","volume-title":"Workshop of Research Institute for Mathematical Sciences (RIMS) Kyoto University","author":"M. Iwami","year":"2007","unstructured":"Iwami, M.: A Reduction Attack on Algebraic Surface Public-Key Cryptosystems. In: Workshop of Research Institute for Mathematical Sciences (RIMS) Kyoto University, New development of research on Computer Algebra, RIMS Kokyuroku, vol.\u00a01572. Springer, Heidelberg (2007)"},{"key":"3_CR13","first-page":"146","volume-title":"EUROCAL","author":"D. Lazard","year":"1983","unstructured":"Lazard, D.: Gr\u00f6bner bases, Gaussian elimination and resolution of systems of algebraic equations. In: EUROCAL, vol.\u00a0162, pp. 146\u2013156. Springer, Heidelberg (1983)"},{"key":"3_CR14","unstructured":"Lecerf, G.: New recombination algorithms for bivariate polynomial factorization based on Hensel lifting. To appear in AAECC (2007)"},{"key":"3_CR15","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":"3_CR16","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"SFCS 1994: Proceedings of the 35th Annual Symposium on Foundations of Computer Science","author":"P.W. Shor","year":"1994","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: SFCS 1994: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 124\u2013134. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"3_CR17","unstructured":"Uchiyama, S., Tokunaga, H.: On the Security of the Algebraic Surface Public-key Cryptosystems. In: Proceedings of SCIS (2007)"},{"key":"3_CR18","volume-title":"Modern computer algebra","author":"J. Zur Gathen Von","year":"2003","unstructured":"Von Zur Gathen, J., Gerhard, J.: Modern computer algebra. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13013-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:44:17Z","timestamp":1558277057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13013-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130120","9783642130137"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13013-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}