×

Algebraic properties of subquasigroups and construction of finite quasigroups. (English. Russian original) Zbl 1522.20234

Algebra Logic 61, No. 4, 251-270 (2022); translation from Algebra Logika 61, No. 4, 375-400 (2022).
Authors’ abstract: Many important properties are identified and criteria are developed for the existence of subquasigroups in finite quasigroups. Based on these results, we propose an effective method that concludes the nonexistence of proper subquasigroups in a given finite quasigroup, or finds all its proper subquasigroups. This has an important application in checking the cryptographic suitability of a quasigroup. Using arithmetic of finite fields, we introduce a binary operation to construct quasigroups of order pr. Criteria are developed under which the quasigroups mentioned have desirable cryptographic properties, such as polynomial completeness and absence of proper subquasigroups. Effective methods are given for constructing cryptographically suitable quasigroups. The efficiency of the methods is illustrated by some academic examples and implementation of all proposed algorithms in the computer algebra system Singular.

MSC:

20N05 Loops, quasigroups
94A60 Cryptography

Software:

SINGULAR
Full Text: DOI

References:

[1] G. B. Belyavskaya, “T-quasigroups and the center of quasigroup,” Mat. Issl., Iss. 111, Stiinca, Kishinev (1989), pp. 24-43. · Zbl 0712.20039
[2] Belyavskaya, GB; Tabarov, AKh, Characteristic of linear and alinear quasigroups, Diskr. Mat., 4, 2, 142-147 (1992) · Zbl 0785.20031
[3] Keedwell, AD; Dénes, J., Latin Squares and Their Applications (2015), Amsterdam: Elsevier, Amsterdam · Zbl 1318.05001
[4] Latin Squares. New Developments in the Theory and Applications, Ann. Discr. Math., 46, J. Dénes and A. D. Keedwell (Eds.), North-Holland, Amsterdam (1991). · Zbl 0715.00010
[5] T. Kepka, “A note on simple quasigroups,” Acta Univ. Carol., Math. Phys., 19, No. 2, 59-60 (1978). · Zbl 0383.20058
[6] P. Nemec and T. Kepka, “T-quasigroups. I,” Acta Univ. Carol., Math. Phys., 12, No. 1, 39-49 (1972). · Zbl 0254.20054
[7] Belyavskaya, GB, Abelian quasigroups are T-quasigroups, Quasigroups Relat. Syst., 1, 1, 1-7 (1994) · Zbl 0951.20503
[8] Shcherbacov, VA, Elements of Quasigroup Theory and Applications (2017), Monogr. Res. Notes Math.: CRC Press, Boca Raton, FL, Monogr. Res. Notes Math. · Zbl 1491.20003 · doi:10.1201/9781315120058
[9] J. D. H. Smith, An Introduction to Quasigroups and Their Representations, Stud. Adv. Math., Chapman & Hall, Boca Raton, FL (2007). · Zbl 1122.20035
[10] Artamonov, VA, Polynomially complete algebras, Uch. Zap. Orlov Gos. Univ., 6, 2, 23-29 (2012)
[11] Artamonov, VA; Chakrabarti, S.; Gangopadhyay, S.; Pal, SK, On Latin squares of polynomially complete quasigroups and quasigroups generated by shifts, Quasigroups Relat. Syst., 21, 2, 117-130 (2013) · Zbl 1294.20073
[12] Artamonov, VA; Chakrabarti, S.; Pal, SK, Characterizations of highly non-associative quasigroups and associative triples, Quasigroups Relat. Syst., 25, 1, 1-19 (2017) · Zbl 1373.20082
[13] A. V. Galatentko, A. E. Pankrat’ev, and S. B. Rodin, “Polynomially complete quasigroups of prime order,” Algebra and Logic, 57, No. 5, 327-335 (2018). · Zbl 1414.20023
[14] O. Grošek and P. Horák, “On quasigroups with few associative triples,” Des. Codes Cryptogr., 64, Nos. 1/2, 221-227 (2012). · Zbl 1250.94036
[15] Artamonov, VA; Chakrabarti, S.; Pal, SK, Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations, Discr. Appl. Math., 200, 5-17 (2016) · Zbl 1338.20063 · doi:10.1016/j.dam.2015.06.033
[16] V. A. Artamonov, “Automorphisms of finite quasigroups with no subquasigroups,” Vest. St. Petersburg Univ., Mat., Mekh., Astron., 7, No. 2, 197-209 (2020).
[17] S. Markovski, D. Gligoroski, and S. Andova, “Using quasigroups for one-one secure encoding,” in Proc. VIII int. Conf. Logic Comp. Sci.: Theoretical Foundations of Computer Science, Lira’97 (Novi Sad, Yugoslavia, September 1-4, 1997), R. Tošić et al. (Eds.), Univ. Novi Sad, Inst. Math., Novi Sad (1997), pp. 157-162. · Zbl 1015.94010
[18] S. Markovski, D. Gligoroski, and V. Bakeva, “Quasigroup string processing: Part 1,” Proc. Maked. Acad. Sci. Arts Math. Tech. Sci., 20, Nos. 1/2, 13-28 (1999). · Zbl 07826074
[19] V. Dimitrova and J. Markovski, “On quasigroup pseudo random sequence generator,” in Proc. 1st Balkan Conf. Inform., Thessaloniki (2004), pp. 393-401.
[20] G. Horváth, C. L. Nehaniv, and Cs. Szabó, “An assertion concerning functionally complete algebras and NP-completeness,” Theor. Comput. Sci., 407, Nos. 1-3, 591-595 (2008). · Zbl 1153.68020
[21] W. Decker, G.-M. Greuel, G. Pfister, and H. Schönemann, Singular 4-1-2—A Computer Algebra System for Polynomial Computations (2019); http://www.singular.uni-kl.de
[22] Hagemann, J.; Herrmann, C., Arithmetical locally equational classes and representation of partial functions, Colloq. Math. Soc. Janos Bolyai, 29, 345-360 (1982) · Zbl 0493.08005
[23] Wall, DW, Sub-quasigroups of finite quasigroups, Pac. J. Math., 7, 1711-1714 (1957) · Zbl 0079.02502 · doi:10.2140/pjm.1957.7.1711
[24] Phillips, JD; Smith, JDH, Quasiprimitivity and quasigroups, Bull. Aust. Math. Soc., 59, 3, 473-475 (1999) · Zbl 0944.20058 · doi:10.1017/S0004972700033165
[25] R. Lidl and H. Niederreiter, Finite Fields, 2nd ed., Encycl. Math. Appl., 20, Cambridge Univ. Press, Cambridge (1996). · Zbl 0866.11069
[26] J. Daemen and V. Rijmen, The Design of Rijndael. AES—The Advanced Encryption Standard, Springer, Berlin (2002). · Zbl 1065.94005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.