{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:38:42Z","timestamp":1648676322567},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s11424-019-8345-3","type":"journal-article","created":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T05:53:25Z","timestamp":1550123605000},"page":"205-233","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Speeding Up the GVW Algorithm via a Substituting Method"],"prefix":"10.1007","volume":"32","author":[{"given":"Ting","family":"Li","sequence":"first","affiliation":[]},{"given":"Yao","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Zhenyu","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Dingkang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"issue":"3\u20134","key":"8345_CR1","first-page":"475","volume":"41","author":"B Buchberger","year":"2006","unstructured":"Buchberger B, Ein Algorithmus zum auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal (An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal), PhD thesis, University of Innsbruck, Innsbruck, Austria, 1965; English translation in Journal of Symbolic Computation, 2006, 41(3\u20134): 475\u2013511.","journal-title":"1965; English translation in Journal of Symbolic Computation"},{"key":"8345_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-12868-9_99","volume":"162","author":"D Lazard","year":"1983","unstructured":"Lazard D, Gr\u00f6bner bases, Gaussian elimination and resolution of systems of algebraic equations, Proc. EUROCAL\u201983, Lect. Notes in Comp. Sci., 1983, 162: 146\u2013156.","journal-title":"Lect. Notes in Comp. Sci."},{"issue":"1\u20133","key":"8345_CR3","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 effcient algorithm for computing Gr\u00f6bner bases (F\n                           4), J. Pure Appl. Algebra, 1999, 139(1\u20133): 61\u201388.","journal-title":"J. Pure Appl. Algebra"},{"key":"8345_CR4","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume":"1807","author":"N Courtois","year":"2000","unstructured":"Courtois N, Klimov A, Patarin J, et al., Efficient algorithms for solving overdefined systems of multivariate polynomial equations, Proc. of EUROCRYPT\u201900, Lect. Notes in Comp. Sci., 2000, 1807: 392\u2013407.","journal-title":"Lect. Notes in Comp. Sci."},{"key":"8345_CR5","first-page":"16","volume-title":"Mutant XL, Proc. SCC\u201908","author":"J Ding","year":"2008","unstructured":"Ding J, Buchmann J, Mohamed M S E, et al., Mutant XL, Proc. SCC\u201908, 2008, 16\u201322."},{"key":"8345_CR6","first-page":"75","volume-title":"Proc. ISSAC\u201902","author":"J C Faug\u00e8re","year":"2002","unstructured":"Faug\u00e8re J C, A new effcient algorithm for computing Gr\u00f6bner bases without reduction to zero (F\n                           5), Proc. ISSAC\u201902, ACM Press, 2002, 75\u201382, Revised version downloaded from fgbrs. lip6.fr\/jcf\/Publications\/index.html."},{"issue":"12","key":"8345_CR7","doi-asserted-by":"publisher","first-page":"1442","DOI":"10.1016\/j.jsc.2010.06.019","volume":"45","author":"C Eder","year":"2010","unstructured":"Eder C and Perry J, F5C: A variant of Faug\u00e8re\u2019s F5 algorithm with reduced Gr\u00f6bner bases, J. Symb. Comput., 2010, 45(12): 1442\u20131458.","journal-title":"J. Symb. Comput."},{"issue":"12","key":"8345_CR8","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1016\/j.jsc.2010.06.013","volume":"45","author":"A Hashemi","year":"2010","unstructured":"Hashemi A and Ars G, Extended F5 criteria, J. Symb. Comput., 2010, 45(12): 1330\u20131340.","journal-title":"J. Symb. Comput."},{"key":"8345_CR9","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.jsc.2011.05.004","volume":"46","author":"A Arri","year":"2011","unstructured":"Arri A and Perry J, The F5 criterion revised, J. Symb. Comput., 2011, 46: 1017\u20131029.","journal-title":"J. Symb. Comput."},{"key":"8345_CR10","first-page":"331","volume-title":"Proc. ISSAC\u201913","author":"C Eder","year":"2013","unstructured":"Eder C and Roune B H, Signature rewriting in Gr\u00f6bner basis computation, Proc. ISSAC\u201913, ACM Press, New York, USA, 2013, 331\u2013338."},{"key":"8345_CR11","first-page":"13","volume-title":"Proc. ISSAC\u201910","author":"S H Gao","year":"2010","unstructured":"Gao S H, Guan Y H, and Volny F, A new incremental algorithm for computing Gr\u00f6bner bases, Proc. ISSAC\u201910, ACM Press, New York, USA, 2010, 13\u201319."},{"issue":"297","key":"8345_CR12","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1090\/mcom\/2969","volume":"85","author":"S H Gao","year":"2016","unstructured":"Gao S H, Volny F, and Wang M S, A new framework for computing Gr\u00f6bner bases, Mathematics of Computation, 2016, 85(297): 449\u2013465.","journal-title":"Mathematics of Computation"},{"key":"8345_CR13","first-page":"337","volume-title":"Proc. ISSAC\u201911","author":"Y Sun","year":"2011","unstructured":"Sun Y and Wang D K, A generalized criterion for signature related Gr\u00f6bner basis algorithms, Proc. ISSAC\u201911, ACM Press, 2011, 337\u2013344."},{"key":"8345_CR14","first-page":"351","volume-title":"Proc. ISSAC\u201912","author":"Y Sun","year":"2012","unstructured":"Sun Y, Wang D K, Ma D X, et al., A signature-based algorithm for computing Gr\u00f6bner bases in solvable polynomial algebras, Proc. ISSAC\u201912, ACM Press, 2012, 351\u2013358."},{"key":"8345_CR15","volume-title":"ACM on International Symposium on Symbolic and Algebraic Computation","author":"B Boyer","year":"2016","unstructured":"Boyer B, Eder C, Faug\u00e8re J, et al., GBLA: Gr\u00f6bner basis linear algebra package, ACM on International Symposium on Symbolic and Algebraic Computation, 2016."},{"key":"8345_CR16","first-page":"89","volume-title":"Proc. PASCO","author":"J C Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re J C and Lachartre S, Parallel Gaussian elimination for Gr\u00f6bner bases computations in finite fields, Proc. PASCO, ACM Press, 2010, 89\u201397."},{"key":"8345_CR17","volume-title":"F4\/5, Preprint","author":"M Albrecht","year":"2010","unstructured":"Albrecht M and Perry J, F4\/5, Preprint, arXiv: 1006.4933v2 [math.AC], 2010."},{"key":"8345_CR18","volume-title":"On the complexity of the F5 Gr\u00f6bner basis algorithm","author":"M Bardet","year":"2013","unstructured":"Bardet M, Faug\u00e8re J C, and Salvy B, On the complexity of the F5 Gr\u00f6bner basis algorithm, arXiv: 1312.1655, 2013."},{"key":"8345_CR19","first-page":"151","volume-title":"Proc. ISSAC\u201909","author":"J C Faug\u00e8re","year":"2009","unstructured":"Faug\u00e8re J C and Rahmany S, Solving systems of polynomial equations with symmetries using SAGBI-Gr\u00f6bner bases, Proc. ISSAC\u201909, ACM Press, New York, USA, 2009, 151\u2013158."},{"key":"8345_CR20","volume-title":"Proc. ISSAC\u201912","author":"B H Roune","year":"2012","unstructured":"Roune B H and Stillman M, Practical Gr\u00f6bner basis computation, Proc. ISSAC\u201912, ACM Press, 2012."},{"key":"8345_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/2930889.2930914","volume-title":"International Symposium on Symbolic and Algebraic Computation","author":"B Boyer","year":"2016","unstructured":"Boyer B, Eder C, Faug\u00e8re J C, et al., GBLA: Gr\u00f6bner basis linear algebra package, International Symposium on Symbolic and Algebraic Computation, 2016, 135\u2013142."},{"key":"8345_CR22","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.ffa.2016.06.002","volume":"41","author":"Y Sun","year":"2016","unstructured":"Sun Y, Lin D D, and Wang D K, An improvement over the GVW algorithm for inhomogeneous polynomial systems, Finite Fields and Their Applications, 2016, 41: 174\u2013192.","journal-title":"Finite Fields and Their Applications"},{"key":"8345_CR23","volume-title":"The M4RI Library \u2014 Version 20130416","author":"M Albrecht","year":"2013","unstructured":"Albrecht M and Bard G, The M4RI Library \u2014 Version 20130416, 2013, http:\/\/m4ri.sagemath.org."},{"issue":"3","key":"8345_CR24","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/s11424-015-4085-1","volume":"29","author":"Y Sun","year":"2016","unstructured":"Sun Y, Lin D D, and Wang D K, On implementing the symbolic preprocessing function over Boolean polynomial rings in Gr\u00f6bner basis algorithms using linear algebra, Journal of Systems Science and Complexity, 2016, 29(3): 789\u2013804.","journal-title":"Journal of Systems Science and Complexity"},{"key":"8345_CR25","volume-title":"Benchmarking algebraic, logical and constraint solvers and study of selected hard problems","author":"N Courtois","year":"2013","unstructured":"Courtois N, Benchmarking algebraic, logical and constraint solvers and study of selected hard problems, 2013, http:\/\/www.cryptosystem.net\/aes\/hardproblems.html."},{"key":"8345_CR26","first-page":"450","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES","author":"A Bogdanov","year":"2007","unstructured":"Bogdanov A, Knudsen L R, Leander G, et al., Present: An ultra-lightweight block cipher, Cryptographic Hardware and Embedded Systems \u2014 CHES, Springer, Berlin Heidelberg, 2007, 450\u2013466."},{"issue":"1","key":"8345_CR27","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s00145-011-9111-4","volume":"26","author":"J Borghoff","year":"2013","unstructured":"Borghoff J, Knudsen L R, Leander G, et al., Slender-set differential cryptanalysis, Journal of Cryptology, 2013, 26(1): 11\u201338.","journal-title":"Journal of Cryptology"},{"issue":"3","key":"8345_CR28","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10623-014-9965-1","volume":"76","author":"G Q Liu","year":"2015","unstructured":"Liu G Q and Jin C H, Differential cryptanalysis of PRESENT-like cipher, Designs, Codes and Cryptography, 2015, 76(3): 385\u2013408.","journal-title":"Codes and Cryptography"},{"key":"8345_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11836810_13","volume-title":"International Conference on Information Security","author":"C D Canni\u00e8re","year":"2006","unstructured":"Canni\u00e8re C De, Trivium: A stream cipher construction inspired by block cipher design principles, International Conference on Information Security, Springer Berlin Heidelberg, 2006, 171\u2013186."},{"key":"8345_CR30","first-page":"77","volume":"6737","author":"Z Huang","year":"2011","unstructured":"Huang Z and Lin D, Attacking bivium and trivium with the characteristic set method, Progress in Cryptology \u2014 AFRICACRYPT 2011, LNCS, 2011, 6737: 77\u201391.","journal-title":"LNCS"},{"issue":"2","key":"8345_CR31","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s11786-009-0016-7","volume":"3","author":"T Eibach","year":"2010","unstructured":"Eibach T and V\u00f6lkel G, Optimising Gr\u00f6bner bases on Bivium, Mathematics in Computer Science 2010, 3(2): 159\u2013172.","journal-title":"Mathematics in Computer Science"},{"key":"8345_CR32","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-35999-6_2","volume-title":"Selected Areas in Cryptography","author":"Z Huang","year":"2013","unstructured":"Huang Z and Lin D, A new method for solving polynomial systems with noise over F22 and its applications in cold boot key recovery, Selected Areas in Cryptography, LNCS 7707, Windsor, Canada, 2013, 16\u201333."},{"key":"8345_CR33","volume-title":"An algebraic cryptanalysis of nonlinear filter generators using Gr\u00f6bner bases","author":"J C Faug\u00e8re","year":"2003","unstructured":"Faug\u00e8re J C and Ars G, An algebraic cryptanalysis of nonlinear filter generators using Gr\u00f6bner bases, TR No. 4739, INRIA, 2003."},{"issue":"6","key":"8345_CR34","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.jsc.2011.12.025","volume":"47","author":"X S Gao","year":"2012","unstructured":"Gao X S and Huang Z, Characteristic set algorithms for equation solving in finite fields, Journal of Symbolic Computation, 2012, 47(6): 655\u2013679.","journal-title":"Journal of Symbolic Computation"},{"key":"8345_CR35","first-page":"3","volume":"72","author":"B Buchberger","year":"1979","unstructured":"Buchberger B, A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner basis, Proceedings of EUROSAM\u201979, Lect. Notes in Comp. Sci., Springer, Berlin, 1979, 72: 3\u201321.","journal-title":"Proceedings of EUROSAM\u201979"},{"key":"8345_CR36","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.jsc.2013.08.001","volume":"59","author":"C Eder","year":"2013","unstructured":"Eder C, An analysis of inhomogeneous signature-based Gr\u00f6bner basis computations, J. Symb. Comput., 2013, 59: 21\u201335.","journal-title":"J. Symb. Comput."},{"key":"8345_CR37","volume-title":"Cryptology ePrint Archive","author":"S H Gao","year":"2010","unstructured":"Gao S H, Volny F, and Wang M S, A new algorithm for computing Gr\u00f6bner bases, Cryptology ePrint Archive, Report 2010\/641, 2010."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-019-8345-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-8345-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-8345-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T00:06:13Z","timestamp":1581638773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-019-8345-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["8345"],"URL":"https:\/\/doi.org\/10.1007\/s11424-019-8345-3","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2]]},"assertion":[{"value":"12 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}