Year: 2025
Type: article
Abstract: 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.
Authors: A. A. Veselova, N. A. Shchuchkin
Institution: Volgograd State Pedagogical University
Language: English
Topic: Mathematics and Applications
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4410017978