Efficient Verification of Polynomial Completeness of Quasigroups
A. V. Galatenko, Anton Evgen'evich Pankratiev, Vladimir Mikhailovich Staroverov · Lobachevskii Journal of Mathematics · 2020
Abstract Polynomial completeness of an operation guarantees that deciding solvability of equations over this operation is an NP-complete problem. Thus this property is beneficial from the viewpoint of cryptographic applications. We propose an algorithm for verification of polynomial completeness of quasigroups and analyse efficiency of its serial and parallel implementations.