Polynomially complete quasigroups of prime order

DOI10.1007/s10469-018-9505-6zbMath1414.20023OpenAlexW2902487235WikidataQ128894413 ScholiaQ128894413MaRDI QIDQ1731318

S. B. Rodin, A. V. Galatentko, Anton E. Pankratiev

Publication date: 13 March 2019

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-018-9505-6

zbMATH Keywords

Latin square\(n\)-quasigrouppolynomially complete quasigroup

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05)

Related Items (5)

Algorithms for checking some properties of \(n\)-quasigroups ⋮ Algebraic properties of subquasigroups and construction of finite quasigroups ⋮ Latin squares over quasigroups ⋮ The complexity of checking the polynomial completeness of finite quasigroups ⋮ Strong polynomial completeness of almost all quasigroups

Cites Work

• Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.
• An assertion concerning functionally complete algebras and NP-completeness
• Communication Theory of Secrecy Systems*
• Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
• Function Algebras on Finite Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomially complete quasigroups of prime order