{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T12:43:50Z","timestamp":1775306630663,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T00:00:00Z","timestamp":1544572800000},"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":["Adv Comput Math"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10444-018-9654-0","type":"journal-article","created":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T05:28:34Z","timestamp":1544592514000},"page":"1769-1792","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6474-7301","authenticated-orcid":false,"given":"Ra\u00fal M.","family":"Falc\u00f3n","sequence":"first","affiliation":[]},{"given":"V\u00edctor","family":"\u00c1lvarez","sequence":"additional","affiliation":[]},{"given":"F\u00e9lix","family":"Gudiel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,12]]},"reference":[{"key":"9654_CR1","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/003","volume-title":"An Introduction to Gr\u00f6bner Bases Graduate Studies in Mathematics, vol. 3","author":"W Adams","year":"1994","unstructured":"Adams, W., Loustaunau, P.: An Introduction to Gr\u00f6bner Bases Graduate Studies in Mathematics, vol. 3. American Mathematical Society, Providence (1994)"},{"key":"9654_CR2","unstructured":"Bayer, D.: The Division Algorithm and the Hilbert Scheme. PhD Thesis, Harvard University (1982)"},{"key":"9654_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.jsc.2005.09.007","volume":"41","author":"B Buchberger","year":"2006","unstructured":"Buchberger, B.: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. J. Symbolic Comput. 41, 475\u2013511 (2006)","journal-title":"J. Symbolic Comput."},{"key":"9654_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1515\/gcc.2010.011","volume":"2","author":"CS Chum","year":"2010","unstructured":"Chum, C.S., Zhang, X.: The Latin squares and the secret sharing schemes. Groups Complex Cryptol. 2, 175\u2013202 (2010)","journal-title":"Groups Complex Cryptol."},{"key":"9654_CR5","first-page":"33","volume":"12","author":"J Cooper","year":"1994","unstructured":"Cooper, J., Donovan, D., Seberry, J.: Secret sharing schemes arising from Latin squares. Bull. Inst. Combin. Appl. 12, 33\u201343 (1994)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"9654_CR6","doi-asserted-by":"crossref","unstructured":"Danan, E., Falcon, R.M., Kotlar, D., Marbach, T.G., Stones, R.J.: Refining invariants for computing autotopism groups of partial Latin rectangles. Submitted (2018)","DOI":"10.1016\/j.endm.2018.06.010"},{"key":"9654_CR7","unstructured":"Decker, W., Greuel, G.M., Pfister, G., Sch\u00f6nemann, H.: Singular 4-1-1. A computer algebra system for polynomial computations. http:\/\/www.singular.uni-kl.de (2018). Accessed 30 September 2018"},{"key":"9654_CR8","volume-title":"Latin Squares and Their Applications","author":"J D\u00e9nes","year":"1974","unstructured":"D\u00e9nes, J., Keedwell, A.D.: Latin Squares and Their Applications. Academic Press, New York-London (1974)"},{"key":"9654_CR9","unstructured":"Dimitrova, V., Markovski, J.: On Quasigroup Pseudo Random Sequence Generator. In: Manolopoulos, Y., Spirakis, P. (eds.) Proceedings of the First Balkan Conference in Informatics, pp 393\u2013401, Thessaloniki (2004)"},{"key":"9654_CR10","unstructured":"Dimitrova, V., Markovski, S.: Classification of quasigroups by image patterns. In: Proceedings of the Fifth International Conference for Informatics and Information Technology, pp 152\u2013160. Bitola, Macedonia (2007)"},{"key":"9654_CR11","unstructured":"Dimitrova, V., Markovski, S., Mileva, A.: Periodic Quasigroup String Transformations. Quasigroups Related Systems 17, 191\u2013204 (2009) On Quasigroup Pseudo Random Sequence Generator. In: Manolopoulos, Y., Spirakis, P. (eds.) Proceedings of the First Balkan Conference in Informatics, pp 393\u2013401, Thessaloniki (2004)"},{"key":"9654_CR12","unstructured":"Falc\u00f3n, R.M.: Latin squares associated to principal autotopisms of long cycles. Application in Cryptography. In: Dumas, J. (ed.) Proceedings of Transgressive Computing 2006, a conference in honor of Jean Della Dora, pp 213\u2013230. Universidad de Granada, Granada (2006)"},{"key":"9654_CR13","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.disc.2011.11.013","volume":"313","author":"RM Falc\u00f3n","year":"2013","unstructured":"Falc\u00f3n, R.M.: The set of autotopisms of partial Latin squares. Discret. Math. 313, 1150\u20131161 (2013)","journal-title":"Discret. Math."},{"key":"9654_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.ejc.2015.02.022","volume":"48","author":"RM Falc\u00f3n","year":"2015","unstructured":"Falc\u00f3n, R.M.: Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method. Eur. J. Combin. 48, 215\u2013223 (2015)","journal-title":"Eur. J. Combin."},{"key":"9654_CR15","doi-asserted-by":"publisher","unstructured":"Falc\u00f3n, R.M., Falc\u00f3n, O.J., N\u00fa\u00f1ez, J.: Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers. Math. Methods Appl. Sci. https:\/\/doi.org\/10.1002\/mma.4820 (2018). Accessed 30 September 2018","DOI":"10.1002\/mma.4820"},{"key":"9654_CR16","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1016\/j.jsc.2007.07.004","volume":"42","author":"RM Falc\u00f3n","year":"2007","unstructured":"Falc\u00f3n, R.M., Mart\u00edn-Morales, J.: Gr\u00f6bner bases and the number of Latin squares related to autotopisms of order 7. J. Symbolic Comput. 42, 1142\u20131154 (2007)","journal-title":"J. Symbolic Comput."},{"key":"9654_CR17","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.endm.2015.06.103","volume":"49","author":"RM Falc\u00f3n","year":"2015","unstructured":"Falc\u00f3n, R.M., Stones, R.J.: Classifying partial Latin rectangles. Electron. Notes Discret. Math. 49, 765\u2013771 (2015)","journal-title":"Electron. Notes Discret. Math."},{"key":"9654_CR18","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1016\/j.disc.2017.01.002","volume":"340","author":"RM Falc\u00f3n","year":"2017","unstructured":"Falc\u00f3n, R.M., Stones, R.J.: Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups. Discret. Math. 340, 1242\u20131260 (2017)","journal-title":"Discret. Math."},{"key":"9654_CR19","unstructured":"Falc\u00f3n, R.M., Stones, R.J.: Enumerating partial Latin rectangles. Submitted (2018)"},{"key":"9654_CR20","unstructured":"Gao, S.: Counting Zeros over Finite Fields Using Gr\u00f6bner Bases. Carnegie Mellon University (2009)"},{"key":"9654_CR21","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s00037-009-0261-9","volume":"18","author":"A Hashemi","year":"2009","unstructured":"Hashemi, A.: Nullstellens\u00e4tze for zero-dimensional Gr\u00f6bner bases. Comput. Complex. 18, 155\u2013168 (2009)","journal-title":"Comput. Complex."},{"key":"9654_CR22","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1142\/S0218196711006364","volume":"21","author":"A Hashemi","year":"2011","unstructured":"Hashemi, A., Lazard, D.: Sharper complexity bounds for zero-dimensional Gr\u00f6bner bases and polynomial system solving. Internat. J. Algebra Comput. 21, 703\u2013713 (2011)","journal-title":"Internat. J. Algebra Comput."},{"key":"9654_CR23","unstructured":"Hillebrand, D.: Triangulierung Nulldimensionaler Ideale - Implementierung Und Vergleich Zweier Algorithmen. Universitaet Dortmund, Fachbereich Mathematik (1999)"},{"key":"9654_CR24","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1090\/S0025-5718-2010-02420-2","volume":"80","author":"A Hulpke","year":"2011","unstructured":"Hulpke, A., Kaski, P., \u00d6Sterg\u00e5rd, P.R.J.: The number of Latin squares of order 11. Math. Comp. 80, 1197\u20131219 (2011)","journal-title":"Math. Comp."},{"key":"9654_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70628-1","volume-title":"Computational commutative algebra 1","author":"M Kreuzer","year":"2000","unstructured":"Kreuzer, M., Robbiano, L.: Computational commutative algebra 1. Springer, Berlin (2000)"},{"key":"9654_CR26","first-page":"109","volume":"6","author":"C Koscielny","year":"1996","unstructured":"Koscielny, C.: A method of constructing quasigroup-based stream-ciphers. Int. J. Appl. Math. Comput. Sci. 6, 109\u2013121 (1996)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"9654_CR27","first-page":"955","volume":"9","author":"C Koscielny","year":"1999","unstructured":"Koscielny, C., Mullen, G.L.: A quasigroup-based public-key cryptosystem. Int. Int. J. Appl. Math. Comput. Sci. 9, 955\u2013963 (1999)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"9654_CR28","doi-asserted-by":"crossref","unstructured":"Lakshman, Y.N.: On the complexity of computing a Gr\u00f6bner basis for the radical of a zero dimensional ideal. In: Ortiz, H. (ed.) Proceedings of the Twenty-Second annual ACM Symposium on Theory of Computing, STOC\u201990, pp 555\u2013563. ACM, New York (1990)","DOI":"10.1145\/100216.100294"},{"key":"9654_CR29","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0747-7171(08)80086-7","volume":"13","author":"D Lazard","year":"1992","unstructured":"Lazard, D.: Solving zero-dimensional algebraic systems. J. Symbolic Comput. 13, 117\u2013131 (1992)","journal-title":"J. Symbolic Comput."},{"key":"9654_CR30","doi-asserted-by":"crossref","unstructured":"Johnson, K.W.: Latin Square Determinants. In: Algebraic, Extremal and Metric Combinatorics 1986, pp. 146\u2013154. London Math. Soc. Lecture Note Ser. 131 (1988)","DOI":"10.1017\/CBO9780511758881.009"},{"key":"9654_CR31","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0097-3165(90)90015-O","volume":"54","author":"G Kolesova","year":"1990","unstructured":"Kolesova, G., Lam, C.W.H., Thiel, L.: On the number of 88 Latin squares. J. Combin. Theory Ser. A 54, 143\u2013148 (1990)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9654_CR32","first-page":"149","volume":"18","author":"S Markovski","year":"2010","unstructured":"Markovski, S., Dimitrova, V., Samardjiska, S.: Identity sieves for quasigroups. Quasigroups Relat. Syst. 18, 149\u2013163 (2010)","journal-title":"Quasigroups Relat. Syst."},{"key":"9654_CR33","unstructured":"Markovski, S., Gligoroski, D., Andova, S.: Using quasigroups for one-one secure encoding. In: Proceedings of Eight Conference Logic and Computer Science (LIRA), pp. 157\u2013162. Novi Sad (1997)"},{"key":"9654_CR34","unstructured":"Markovski, S., Gligoroski, D., Bakeva, V.: Quasigroup string processing: Part 1. In: Proceedings of Macedonian Academy of Sciences and Arts for Mathematical and Technical Sciences XX, 1-2, pp. 13\u201328 (1999)"},{"key":"9654_CR35","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02935788","volume":"19","author":"S Markovski","year":"2005","unstructured":"Markovski, S., Gligoroski Markovski, J.: Classification of quasigroups by random walk on torus. J. Appl. Math. Comput. 19, 57\u201375 (2005)","journal-title":"J. Appl. Math. Comput."},{"key":"9654_CR36","unstructured":"Markovski, S., Kusakatov, V.: Quasigroup string processing: Part 2. In: Proceedings of Macedonian Academy of Sciences and Arts for Mathematical and Technical Sciences XXI, 1-2, pp. 15\u201332 (2000)"},{"key":"9654_CR37","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1002\/jcd.20105","volume":"15","author":"BD McKay","year":"2007","unstructured":"McKay, B.D., Meynert, A., Myrvold, W.: Small Latin squares, quasigroups, and loops. J. Combin. Des. 15, 98\u2013119 (2007)","journal-title":"J. Combin. Des."},{"key":"9654_CR38","unstructured":"Moldovyan, N.A., Shcherbacov, A.V., Shcherbacov, V.: On Some Applications of Quasigroups in Cryptography. In: Workshop on Foundations of Informatics, pp 331\u2013340. Acad. Sci. Moldova, Inst. Math. Comput. Sci., Chi\u015fin\u0103u (2015)"},{"key":"9654_CR39","first-page":"55","volume":"24","author":"NA Moldovyan","year":"2016","unstructured":"Moldovyan, N.A., Shcherbacov, A.V., Shcherbacov, V.A.: Some applications of quasigroups in cryptology. Comput. Sci. J. Moldova 24, 55\u201367 (2016)","journal-title":"Comput. Sci. J. Moldova"},{"key":"9654_CR40","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01200146","volume":"4","author":"HM M\u00f6ller","year":"1993","unstructured":"M\u00f6ller, H.M.: On decomposing systems of polynomial equations with finitely many solutions. Appl. Algebra Engrg. Comm. Comput. 4, 217\u2013230 (1993)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"9654_CR41","doi-asserted-by":"publisher","DOI":"10.1201\/9781315120058","volume-title":"Elements of quasigroup theory and applications. Monographs and Research Notes in Mathematics","author":"V Shcherbacov","year":"2017","unstructured":"Shcherbacov, V.: Elements of quasigroup theory and applications. Monographs and Research Notes in Mathematics. CRC Press, Boca Raton (2017)"},{"key":"9654_CR42","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1016\/j.ejc.2013.02.005","volume":"34","author":"DS Stones","year":"2013","unstructured":"Stones, D.S.: Symmetries of partial Latin squares. Eur. J. Combin. 34, 1092\u20131107 (2013)","journal-title":"Eur. J. Combin."},{"key":"9654_CR43","unstructured":"Stones, R.J., Falc\u00f3n, R.M., Kotlar, D., Marbach, T.G.: Computing autotopism groups of partial Latin rectangles: a pilot study. Submitted (2018)"},{"key":"9654_CR44","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s10623-015-0123-1","volume":"80","author":"RJ Stones","year":"2015","unstructured":"Stones, R.J., Su, M., Liu, X., Wang, G., Lin, S.: A Latin square autotopism secret sharing scheme. Des. Codes Cryptogr. 80, 635\u2013650 (2015)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-018-9654-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-018-9654-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-018-9654-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T11:43:58Z","timestamp":1775303038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-018-9654-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,12]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["9654"],"URL":"https:\/\/doi.org\/10.1007\/s10444-018-9654-0","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,12]]},"assertion":[{"value":"30 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}