{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:58:19Z","timestamp":1760061499414},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540365976"},{"type":"electronic","value":"9783540365983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11799313_6","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T14:02:13Z","timestamp":1160056933000},"page":"78-88","source":"Crossref","is-referenced-by-count":17,"title":["A Zero-Dimensional Gr\u00f6bner Basis for AES-128"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Buchmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Pyshkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf-Philipp","family":"Weinmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2\/3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0747-7171(88)80039-7","volume":"6","author":"D. Bayer","year":"1988","unstructured":"Bayer, D., Stillman, M.: On the complexity of computing syzygies. Journal of Symbolic Computation\u00a06(2\/3), 135\u2013147 (1988)","journal-title":"Journal of Symbolic Computation"},{"key":"6_CR2","volume-title":"Gr\u00f6bner Bases \u2013 A Computational Approach to Commutative Algebra","author":"T. Becker","year":"1991","unstructured":"Becker, T., Weispfenning, V.: Gr\u00f6bner Bases \u2013 A Computational Approach to Commutative Algebra. Springer, Heidelberg (1991)"},{"key":"6_CR3","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, University of Innsbruck, Austria (1965)"},{"key":"6_CR4","first-page":"3","volume-title":"A criterion for Detecting Unnecessary Reductions in the Construction of Groebner Bases","author":"B. Buchberger","year":"1979","unstructured":"Buchberger, B.: A criterion for Detecting Unnecessary Reductions in the Construction of Groebner Bases, London, UK, Johannes Kepler University Linz, vol.\u00a072, pp. 3\u201321. Springer, Heidelberg (1979)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/11605805_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"J. Buchmann","year":"2006","unstructured":"Buchmann, J., Pyshkin, A., Weinmann, R.-P.: Block Ciphers Sensitive to Gr\u00f6bner Basis Attacks. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol.\u00a03860, pp. 313\u2013331. Springer, Heidelberg (2006)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/11593447_18","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"C. Cid","year":"2005","unstructured":"Cid, C., Leurent, G.: An analysis of the XSL Algorithm. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 333\u2013352. Springer, Heidelberg (2005)"},{"issue":"3\/4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1006\/jsco.1996.0145","volume":"24","author":"S. Collart","year":"1997","unstructured":"Collart, S., Kalkbrener, M., Mall, D.: Converting Bases with the Gr\u00f6bner Walk. Journal of Symbolic Computation\u00a024(3\/4), 465\u2013469 (1997)","journal-title":"Journal of Symbolic Computation"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-36178-2_17","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"N. Courtois","year":"2002","unstructured":"Courtois, N., Pieprzyk, J.: Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 267\u2013287. Springer, Heidelberg (2002)"},{"key":"6_CR9","first-page":"536","volume-title":"Ideals, Varieties, and Algorithms","author":"D.A. Cox","year":"1996","unstructured":"Cox, D.A., Little, J.B., O\u2019Shea, D.: Ideals, Varieties, and Algorithms, 2nd edn., p. 536. Springer, New York (1996)","edition":"2"},{"issue":"1-3","key":"6_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":"6_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"Symbolic and Algebraic Computation \u2013 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: Symbolic and Algebraic Computation \u2013 ISSAC 2002, pp. 75\u201383. ACM, New York (2002)"},{"issue":"4","key":"6_CR12","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":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-45537-X_8","volume-title":"Selected Areas in Cryptography","author":"N. Ferguson","year":"2001","unstructured":"Ferguson, N., Schroeppel, R., Whiting, D.: A Simple Algebraic Representation of Rijndael. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol.\u00a02259, pp. 103\u2013111. Springer, Heidelberg (2001)"},{"issue":"1-2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/jsco.1998.0276","volume":"28","author":"M. Kalkbrener","year":"1999","unstructured":"Kalkbrener, M.: On the Complexity of Gr\u00f6bner Bases Conversion. Journal of Symbolic Computation\u00a028(1-2), 265\u2013273 (1999)","journal-title":"Journal of Symbolic Computation"},{"key":"6_CR15","unstructured":"Murphy, S., Robshaw, M.: Further Comments on the Structure of Rijndael. AES Comment to NIST (August. 2000)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45708-9_1","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"S. Murphy","year":"2002","unstructured":"Murphy, S., Robshaw, M.J.B.: Essential Algebraic Structure within the AES. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 1\u201316. Springer, Heidelberg (2002)"},{"key":"6_CR17","unstructured":"National Institute of Standards and Technology. FIPS-197: Advanced Encryption Standard (November 2001), Available at, \n                    \n                      http:\/\/csrc.nist.gov\/publications\/fips\/"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11799313_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:24:34Z","timestamp":1619508274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11799313_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540365976","9783540365983"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11799313_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}