Cryptosystems based on ternary self-orthogonal quasigroups

Abstract

In this qualifying paper we describe an algorithm for constructing a class of left-symmetric quasigroups of order 32. It is established that the described algorithm can be used to construct 2 \ast 6 33 quasigroups of order 32. An algorithm for symmetric encryption of information using a ternary quasigroup of order 32, which is constructed as a unique composition of two binary quasigroups, is developed.