Efficient algorithms for checking some properties of n-quasigroups that are important from the cryptography point of view are described. These are the properties of polynomial completeness (which is equivalent to simplicity and nonaffinity) and the existence of n-subquasigroups. Estimates of the execution time of the proposed algorithms and their spatial complexity are derived, and results of numerical experiments for assessing the practical efficiency of their computer implementation are provided.
No takes yet. Share an insight, caveat, or question.
Galatenko et al. (2022) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: