Algorithms for checking some properties of \(n\)-quasigroups

DOI10.1134/S0361768822010042zbMath1494.68311OpenAlexW4210603638MaRDI QIDQ2132552

Vladimir M. Staroverov, Anton E. Pankratiev, Aleksey V. Galatenko

Publication date: 28 April 2022

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768822010042

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Loops, quasigroups (20N05)

Related Items (2)

Generation of proper families of functions ⋮ Proper families of functions and their applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of checking the polynomial completeness of finite quasigroups
• An assertion concerning functionally complete algebras and NP-completeness
• Polynomially complete quasigroups of prime order
• The method of colored graphs for simplifying expressions with indices
• Efficient verification of polynomial completeness of quasigroups
• Quasigroups in cryptology
• A novel cryptosystem based on abstract automata and Latin cubes
• Communication Theory of Secrecy Systems*
• Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations

This page was built for publication: Algorithms for checking some properties of \(n\)-quasigroups