Word transformation using ternary (L, M)-quasigroups

We construct an algorithm for transforming words using a set of finite quasigroups in an amount equal to the number of characters of the alphabet. Some properties of ternary (L,M)-quasigroups are given, which play an important role in the analysis and design of cryptographic schemes based on these algebras, such as polynomial completeness, absence of nontrivial congruences.