Reproduce “An encryption algorithm using a generalization of the Markovski algorithm and a system of orthogonal operations based on T-quasigroups” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Nadezhda Malyutina, Alexander Popov, Victor Shcherbacov
A generalized encryption algorithm is presented, combining iterated quasigroup translations with systems of orthogonal operations for symmetric encryption. Implemented using T-quasigroups over an Abelian group, the algorithm achieves deterministic reversibility and exhibits stream cipher characteristics by processing data sequentially with stateful dependencies.
Key insights
- The combination of generalized quasigroup translations and orthogonal quasigroup systems can effectively increase the complexity and diffusion characteristics of a symmetric cipher.
- T-quasigroups, particularly medial ones over Abelian groups, offer algebraically tractable foundations for constructing reversible quasigroup operations suitable for cryptographic algorithms.
- Dynamic parameters, such as varying translation powers and ciphertext-derived "leader elements," introduce statefulness, which contributes to resisting cryptanalytic and statistical attacks.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.