\(n\)-quasigroups at the output of the isotopic transformation algorithm, which guarantees cryptographic properties">

Intelligent Systems.
Theory and Applications

(Intellektual'nye Sistemy. Teoriya i Prilozheniya)

An estimate for the number of \(n\)-quasigroups at the output of the isotopic transformation algorithm, which guarantees cryptographic properties

Abstract

The paper considers \(n\)-quasigroups in the context of properties relevant to cryptographic applications. For a parameterized family of isotopic transformations, an estimate is given for the number of distinct \(n\)-quasigroups obtained from a given \(n\)-quasigroup by applying different transformations of the family.

Keywords: $n$-quasigroup, isotopy, polynomial completeness, simplicity, non-affineness, subquasigroup.

BibTeX
@article{IS-Chaplygina2026,
  author  = {Chaplygina, Svetlana Sergeevna},
  title   = {{An estimate for the number of $n$-quasigroups at the output of the isotopic transformation algorithm, which guarantees cryptographic properties}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2026},
  volume  = {30},
  number  = {4},
  pages   = {294--297},
}
AMSBIB
\Bibitem{IS-Chaplygina2026}
\by S.\,S.~Chaplygina
\paper An estimate for the number of $n$-quasigroups at the output of the isotopic transformation algorithm, which guarantees cryptographic properties
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 294--297
\lang In Russian
Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue

× Issue cover