{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T19:44:54Z","timestamp":1765827894541},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T00:00:00Z","timestamp":1587081600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T00:00:00Z","timestamp":1587081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00200-020-00428-w","type":"journal-article","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T15:04:03Z","timestamp":1587135843000},"page":"235-252","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Why you cannot even hope to use Gr\u00f6bner bases in cryptography: an eternal golden braid of failures"],"prefix":"10.1007","volume":"31","author":[{"given":"Boo","family":"Barkee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michela","family":"Ceria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theo","family":"Moriarty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Visconti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"428_CR1","first-page":"173","volume":"17","author":"P Ackermann","year":"2006","unstructured":"Ackermann, P., Kreuzer, M.: Gr\u00f6bner basis cyptosystems. J. Appl. Alg. 17, 173\u2013194 (2006)","journal-title":"J. Appl. Alg."},{"key":"428_CR2","first-page":"179","volume":"7073","author":"MR Albrecht","year":"2011","unstructured":"Albrecht, M.R., Farshim, P., Faug\u00e8re, J.-C., Perret, L.: Polly Cracker, Revisited. L.N.C.S 7073, 179\u2013196 (2011)","journal-title":"L.N.C.S"},{"key":"428_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10623-015-0048-8","volume":"79","author":"MR Albrecht","year":"2016","unstructured":"Albrecht, M.R., Farshim, P., Faug\u00e8re, J.-C., Perret, L.: Polly Cracker, revisited. Des. Codes Cryptogr. 79, 261\u2013302 (2016)","journal-title":"Des. Codes Cryptogr."},{"key":"428_CR4","unstructured":"Alonso, M.E., Marinari, M.G., Mora, T.: Oracle-supported drawing of the Gr\u00f6bner \u00e9scalier\u201d. preprint (2008)"},{"key":"428_CR5","unstructured":"Backelin, J., Cojocaru, S., Ufnarovski, V.: Mathematical Computations using Bergman Lund University"},{"key":"428_CR6","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1006\/jsco.1994.1061","volume":"18","author":"B Barkee","year":"1994","unstructured":"Barkee, B., Can, D.C., Ecks, J., Moriarty, T., Ree, R.F.: Why you cannot even hope to use Gr\u00f6bner Bases in Public Key Cryptography. J. Symb. Comp. 18, 497\u2013501 (1994)","journal-title":"J. Symb. Comp."},{"key":"428_CR7","unstructured":"Billet, O., Patarin, J., Seurin, Y.: Analysis of Intermediate Field Systems, eprint iacr 542 (2009)"},{"key":"428_CR8","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph. D. Thesis, Innsbruck (1965)"},{"key":"428_CR9","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BF01844169","volume":"4","author":"B Buchberger","year":"1970","unstructured":"Buchberger, B.: Ein algorithmisches Kriterium f\u00fcr die L\u00f6sbarkeit eines algebraischen Gleischunssystem. Aeq. Math. 4, 374\u2013383 (1970)","journal-title":"Aeq. Math."},{"key":"428_CR10","first-page":"3","volume":"72","author":"B Buchberger","year":"1979","unstructured":"Buchberger, B.: A Criterion for Detecting Unnecessary Reduction in the Construction of Gr\u00f6bner bases. L.N.C.S 72, 3\u201321 (1979)","journal-title":"L.N.C.S"},{"key":"428_CR11","unstructured":"Buchberger, B.: Miscellaneours Results on Groebner Bases for Polynomial Ideals II. Technical Report 83\/1, University of Delaware, Department of Computer and Information Sciences, p. 31 (1983)"},{"key":"428_CR12","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: Gr\u00f6bner bases computation by triangularizing Macaulay matrices. The 50th Anniversary of Gr\u00f6bner Bases. Mathematical Society of Japan (2018)","DOI":"10.1109\/SYNASC.2017.00011"},{"key":"428_CR13","unstructured":"Bulygin, S.: Chosen-cyphertext attack on noncommutative Polly Cracker. arXiv:abs\/cs\/0508015"},{"key":"428_CR14","unstructured":"Burger, R., Heinle, A.: A Diffie-Hellman-like key exchange protocol based on multivariate Ore polynomials. preprint (2014). arXiv:1407.1270.pdf"},{"key":"428_CR15","doi-asserted-by":"crossref","unstructured":"Caboara, M., Caruso, F., Traverso, C.: Gr\u00f6bner bases for public key cryptography. To appear on ACM Press, New York, ISSAC 08: Proceedings of the 2008 International Symposium on Symbolic and Algebraic Computation","DOI":"10.1145\/1390768.1390811"},{"key":"428_CR16","unstructured":"Caboara, M., Caruso, F., Traverso, C.: Block lattice polly cracker, theory and practice. Second Workshop on Mathematical Cryptology, Santander, 24-27 Ottobre (2008). pp. 75\u201382. [Extended Abstract]"},{"key":"428_CR17","unstructured":"Caboara, M., Caruso, F., Traverso, C.: Heterogeneous lattice metrics and the NTWO cryptosystem Second Workshop on Mathematical Cryptology , Santander, 24-27 Ottobre (2008). pp. 118\u2013121"},{"issue":"5","key":"428_CR18","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/j.jsc.2010.10.004","volume":"46","author":"M Caboara","year":"2011","unstructured":"Caboara, M., Caruso, F., Traverso, C.: Block Lattice Polly Cracker: design, implementation and security. J. Symb. Comput. 46(5), 534\u2013549 (2011)","journal-title":"J. Symb. Comput."},{"key":"428_CR19","unstructured":"Cao, Z., Dong, X., Wang, L.: New Public Key Cryptosystems using polynomials over Non-commutative rings, Cryptology e-print Archive, 2007. https:\/\/eprint.iacr.org\/2007\/009.pdf"},{"key":"428_CR20","unstructured":"Caruso, F.: Factorization of Non-Commutative Polynomials (2010). arXiv:1002.3180"},{"issue":"12","key":"428_CR21","doi-asserted-by":"publisher","first-page":"2974","DOI":"10.1016\/j.jpaa.2017.02.011","volume":"221","author":"M Ceria","year":"2017","unstructured":"Ceria, M., Mora, T.: Buchberger\u2013Zacharias theory of multivariate Ore extensions. J. Pure Appl. Algebra 221(12), 2974\u20133026 (2017)","journal-title":"J. Pure Appl. Algebra"},{"key":"428_CR22","unstructured":"Ceria, M., Moriarty, T., Visconti, A.: Why you should not even think to use Ore algebras in Cryptography. https:\/\/www.researchgate.net\/publication\/335608455_Why_you_should_not_even_think_to_use_Ore_algebras_in_Cryptography"},{"key":"428_CR23","first-page":"24","volume":"3","author":"S Cojocaru","year":"1995","unstructured":"Cojocaru, S., Ufnarovski, V.: Noncommuatative Gr\u00f6bner basis, Hilbert series, Anick\u2019s resolution and BERGMAN under MS-DOS. Comput. Sci. J. Moldova 3, 24\u201339 (1995)","journal-title":"Comput. Sci. J. Moldova"},{"key":"428_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0166-218X(91)90109-A","volume":"33","author":"A Dickenstein","year":"1991","unstructured":"Dickenstein, A., Fitchas, N., Giusti, M., Sessa, C.: The membership problem for unmixed polynomial ideals is solvable in single exponential time. Discrete Appl. Math. 33, 73\u201394 (1991)","journal-title":"Discrete Appl. Math."},{"key":"428_CR25","doi-asserted-by":"crossref","unstructured":"Dub\u00e9, T.W.: The Structure of Polynomial Ideals and Gr\u00f6bner Bases SIAM J. Comput. 19(4) (2006)","DOI":"10.1137\/0219053"},{"key":"428_CR26","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 computating Gr\u00f6bner bases ($$F_4$$). J. Pure Appl. Algebra 139, 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"428_CR27","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computating Gr\u00f6bner bases without reduction to zero ($$F_5$$), Proc. ISSAC 2002, 75\u201383, ACM (2002)","DOI":"10.1145\/780506.780516"},{"key":"428_CR28","doi-asserted-by":"crossref","unstructured":"J-C.Faug\u00e8re, A. Joux, Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems using Grobner Bases, In Dan Boneh, editor, Ad-vances in Cryptology\u2014CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science. UK: Springer, pp. 44\u201360 (2003)","DOI":"10.1007\/978-3-540-45146-4_3"},{"key":"428_CR29","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-48071-4_27","volume":"740","author":"MR Fellows","year":"1993","unstructured":"Fellows, M.R., Koblitz, N.: Kid krypto. Advances in Cryptography - Crypto\u201992. Lect. N. Comp. Sci. 740, 371\u2013389 (1993)","journal-title":"Lect. N. Comp. Sci."},{"key":"428_CR30","first-page":"9","volume":"99","author":"MR Fellows","year":"1994","unstructured":"Fellows, M.R., Koblitz, N.: Combinatorially based cryptography for children (and adults). Congressus Numer. 99, 9\u201341 (1994)","journal-title":"Congressus Numer."},{"key":"428_CR31","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1090\/conm\/168\/01688","volume":"168","author":"MR Fellows","year":"1994","unstructured":"Fellows, M.R., Koblitz, N.: Combinatorial cryptosystems galore!. Contempor. Math. 168, 51\u201361 (1994)","journal-title":"Contempor. Math."},{"key":"428_CR32","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0747-7171(88)80048-8","volume":"6","author":"R Gebauer","year":"1988","unstructured":"Gebauer, R., M\u00f6ller, H.M.: On an Installation of Buchbgerger\u2019s Algorithm. J. Symb. Comp. 6, 275\u2013286 (1988)","journal-title":"J. Symb. Comp."},{"key":"428_CR33","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S0378-4754(97)00128-6","volume":"45","author":"VP Gerdt","year":"1998","unstructured":"Gerdt, V.P., Blinkov, Y.A.: Involutive bases of polynomial ideals. Math. Comp. Simul. 45, 543\u2013560 (1998)","journal-title":"Math. Comp. Simul."},{"key":"428_CR34","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/S0378-4754(97)00127-4","volume":"45","author":"VP Gerdt","year":"1998","unstructured":"Gerdt, V.P., Blinkov, Y.A.: Minimal involutive bases. Math. Comp. Simul. 45, 519\u2013541 (1998)","journal-title":"Math. Comp. Simul."},{"key":"428_CR35","doi-asserted-by":"crossref","unstructured":"Giovini, A., et al.: \u201cOne sugar cube, please\u201d OR Selection strategies in the Buchberger algorithm, Proc. ISSAC \u201991, 49\u201354, ACM (1991)","DOI":"10.1145\/120694.120701"},{"key":"428_CR36","first-page":"93","volume":"15","author":"EL Green","year":"1991","unstructured":"Green, E.L., Mora, T., Ufnarovski, V.: The non-commutative Gr\u00f6bner freaks. Progress Comput. Sci. Appl. Logic 15, 93\u2013104 (1991). Birkh\u00e4user","journal-title":"Progress Comput. Sci. Appl. Logic"},{"key":"428_CR37","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/BF01206635","volume":"95","author":"G Hermann","year":"1926","unstructured":"Hermann, G.: Die Frage der endlich vielen Schritte in die Theorie der Polynomideale. Math. Ann. 95, 736\u2013788 (1926)","journal-title":"Math. Ann."},{"key":"428_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0747-7171(08)80003-X","volume":"9","author":"A Kandri-Rody","year":"1990","unstructured":"Kandri-Rody, A., Weispfenning, W.: Non-commutative Gr\u00f6bner Bases in Algebras of Solvable Type. J. Symb. Comp. 9, 1\u201326 (1990)","journal-title":"J. Symb. Comp."},{"key":"428_CR39","unstructured":"Kanwal, S., Inam, S., Ali, R.., Qiu, S.: Two new variants of stickel\u2019s key exchange protocol based on polynomials over noncommutative rings"},{"key":"428_CR40","first-page":"65","volume":"3","author":"M Janet","year":"1920","unstructured":"Janet, M.: Sur les syst\u00e8mes d\u2019\u00e9quations aux d\u00e9riv\u00e9es partielles. J. Math. Pure et Appl. 3, 65\u2013151 (1920)","journal-title":"J. Math. Pure et Appl."},{"key":"428_CR41","doi-asserted-by":"crossref","unstructured":"Levy-dit-Vehel, F., Marinari, M.G., Perret, L., Traverso, C.: A Survey on Polly Cracker Systems in Sala, M., et al. (Ed.) Gr\u00f6bner bases, Coding, Cryptography, Springer Risc XVI, pp. 285\u2013305 (2009)","DOI":"10.1007\/978-3-540-93806-4_16"},{"key":"428_CR42","first-page":"177","volume":"23","author":"F Levy-dit-Vehel","year":"2004","unstructured":"Levy-dit-Vehel, F., Perret, L.: A Polly Cracker system based on satisfiability. Progress Comput. Sci. Appl. Logic 23, 177\u2013192 (2004)","journal-title":"Progress Comput. Sci. Appl. Logic"},{"key":"428_CR43","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/BF01455345","volume":"74","author":"FS Macaulay","year":"1913","unstructured":"Macaulay, F.S.: On the resolution of a given modular system into primary systems including some properties of Hilbert Numbers. Math. Ann. 74, 66\u2013121 (1913)","journal-title":"Math. Ann."},{"key":"428_CR44","doi-asserted-by":"crossref","DOI":"10.3792\/chmm\/1263317740","volume-title":"The Algebraic Theory of Modular Systems","author":"FS Macaulay","year":"1916","unstructured":"Macaulay, F.S.: The Algebraic Theory of Modular Systems. Cambridge Univ. Press, Cambridge (1916)"},{"key":"428_CR45","doi-asserted-by":"crossref","unstructured":"Madlener, K., Reinert, B.: Computing Gr\u00f6bner bases in monoid and group rings, Proc. ISSAC \u201993, ACM, pp. 254\u2013263 (1993)","DOI":"10.1145\/164081.164139"},{"key":"428_CR46","unstructured":"Maza, G.: Algebraic Methods for Constructing One-Way Trapdoor Functions, PhD Thesis, University of Notre Dame, 2003. http:\/\/user.math.uzh.ch\/maze\/Articles\/DissJoli.pdf"},{"key":"428_CR47","doi-asserted-by":"crossref","unstructured":"Maza, G., Monico, C., Rosenthal, J.: Public Key Cryptography based on Semigroup Actions [pdf arXiv]. In Advances of Mathematics of Communications, Vol. 1, 4 (2007), pp. 489-507. https:\/\/www.math.uzh.ch\/aa\/fileadmin\/user\/rosen\/publikation\/ma07.pdf","DOI":"10.3934\/amc.2007.1.489"},{"key":"428_CR48","unstructured":"M\u00e5rtensson, K.: An algorithm to detect regular behaviour of binomial Gr\u00f6bner Basis rational language. Master\u2019s Thesis, Lund University (2006)"},{"key":"428_CR49","first-page":"700","volume":"7237","author":"D Micciancio","year":"2010","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. L.N.C.S 7237, 700\u2013718 (2010)","journal-title":"L.N.C.S"},{"key":"428_CR50","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0747-7171(88)80052-X","volume":"6","author":"HM M\u00f6ller","year":"1988","unstructured":"M\u00f6ller, H.M.: On the construction of Gr\u00f6bner bases using syzygies. J. Symb. Comp. 6, 345\u2013359 (1988)","journal-title":"J. Symb. Comp."},{"key":"428_CR51","doi-asserted-by":"crossref","unstructured":"Mora, F.: De Nugis Groebnerialium 2: Applying Macaulay\u2019s Trick in order to easily write a Groebner basis. J. Appl. Alg.(2003)","DOI":"10.1007\/s00200-002-0112-2"},{"key":"428_CR52","doi-asserted-by":"publisher","unstructured":"Nguefack, B., Pola, E.: Effective Buchberger-Zacharias-Weispfenning theory of skew polynomial extensions of restricted bilateral coherent rings. J. Symb. Comp. (2019). https:\/\/doi.org\/10.1016\/j.jsc.2019.03.003","DOI":"10.1016\/j.jsc.2019.03.003"},{"key":"428_CR53","doi-asserted-by":"crossref","unstructured":"Mora, T.: Solving Polynomial Equation Systems 4 Vols., Cambridge University Press, I (2003), II (2005), III (2015), IV (2016)","DOI":"10.1017\/CBO9781107340954"},{"key":"428_CR54","unstructured":"Mullan, C.: Some results in group-based cryptography, Technical report, Department of Mathematics, Royal Holloway, University of London (2012)"},{"key":"428_CR55","doi-asserted-by":"publisher","first-page":"480","DOI":"10.2307\/1968173","volume":"34","author":"O Ore","year":"1933","unstructured":"Ore, O.: Theory of non-commutative polynomials. Ann. Math. 34, 480\u2013508 (1933)","journal-title":"Ann. Math."},{"key":"428_CR56","doi-asserted-by":"crossref","unstructured":"Patarin, J.: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, In Ueli M. Maurer, editor, Advances in Cryptology\u2014EUROCRYPT\u201996, volume 1070 of Lecture Notes in Com-puter Science, pages 33\u201348. Springer (1996)","DOI":"10.1007\/3-540-68339-9_4"},{"key":"428_CR57","unstructured":"Pesch, M.: Gr\u00f6bner bases in skew polynomial rings. Dissertation, Passau (1997)"},{"key":"428_CR58","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jsco.1996.0040","volume":"22","author":"FL Pritchard","year":"1996","unstructured":"Pritchard, F.L.: The ideal membership problem in non-commutative polynomial rings. J. Symb. Comp. 22, 27\u201348 (1996)","journal-title":"J. Symb. Comp."},{"key":"428_CR59","unstructured":"Rai, T.S.: Infinite Gr\u00f6bner bases and Noncommutative Polly Cracker Cryptosystems PhD Thesis, Virginia Polytechnique Institute and State Univ. (2004)"},{"key":"428_CR60","unstructured":"Rai, T.S.: Countering chosen-ciphertext attacks against noncommutative polly cracker cryptosystems (2005) Cryptology ePrint Archive: Report 2005\/344. https:\/\/eprint.iacr.org\/2005\/344.pdf"},{"key":"428_CR61","unstructured":"Reinert, B.: On Gr\u00f6bner Bases in Monoid and Group Rings, Thesis. Kaiserslautern (1995)"},{"key":"428_CR62","first-page":"283","volume":"5010","author":"V Shpilrain","year":"2008","unstructured":"Shpilrain, V.: Cryptanalysis of Stickel\u2019s key exchange scheme. Proc. Comput. Sci. Russia 5010, 283\u2013288 (2008)","journal-title":"Proc. Comput. Sci. Russia"},{"key":"428_CR63","unstructured":"Shpilrain, V., Ushakov, A.: Thompson\u2019s group and public key cryptography. In Third International Conference, ACNS 2005, volume 3531 of Lecture Notes in Comput. Sci., pages 151-163. Springer, Berlin, (2005). Availabe at https:\/\/arxiv.org\/pdf\/math\/0505487v1.pdf"},{"key":"428_CR64","unstructured":"Sramka, M.: On the security of stickel\u2019s key exchange scheme. JCMCC 66 (2008)"},{"key":"428_CR65","unstructured":"Stickel, E.: A new method for exchanging secret key, Proceedings of the Third International Conference on Information Technology and Applications (ICITA\u201905), 426\u2013430. Sidney, Australia (2005)"},{"key":"428_CR66","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10207-002-0012-2","volume":"1","author":"R Steinwandt","year":"2002","unstructured":"Steinwandt, R., Geiselmann, W., Endsuleit, R.: Attacking a polynomial-based cryptosystem: Polly Cracker. Int. J. Inf. Secur. 1, 143\u2013148 (2002)","journal-title":"Int. J. Inf. Secur."},{"issue":"11","key":"428_CR67","doi-asserted-by":"publisher","first-page":"2990","DOI":"10.1109\/TIT.2002.804112","volume":"48","author":"R Steinwandt","year":"2002","unstructured":"Steinwandt, R., Geiselmann, W.: Cryptoasnalysis of Polly Cracker. IEEE Trans. Inf. Th. 48(11), 2990\u20131 (2002)","journal-title":"IEEE Trans. Inf. Th."},{"key":"428_CR68","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10207-002-0012-2","volume":"1","author":"D Hofheinz","year":"2002","unstructured":"Hofheinz, D., Steinwandt, R.: A \u201cDifferential\u201d Attack on Polly Cracker. Int. J. Inf. Secur. 1, 143\u2013148 (2002)","journal-title":"Int. J. Inf. Secur."},{"key":"428_CR69","first-page":"19","volume":"196","author":"NR Wagner","year":"1985","unstructured":"Wagner, N.R., Magyarik, M.R.: A Publyc-Key Cryptosystem based on the Word Problem. L. N. Comp. Sci 196, 19\u201336 (1985). Springer","journal-title":"L. N. Comp. Sci"},{"key":"428_CR70","unstructured":"Wiesinger-Widi, M.: Groebner Bases and Generalized Sylvester Matrices. Ph.D. Thesis, Johannes Kepler University, Institute for Symbolic Computation, submitted (2014). https:\/\/www.dk-compmath.jku.at\/publications\/phd-theses\/2015-06-05\/view"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00428-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-020-00428-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00428-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T23:14:40Z","timestamp":1618614880000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-020-00428-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,17]]},"references-count":70,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["428"],"URL":"https:\/\/doi.org\/10.1007\/s00200-020-00428-w","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,17]]},"assertion":[{"value":"29 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}