RUS
ENG
Full version
JOURNALS
// Prikladnaya Diskretnaya Matematika
// Archive
Prikl. Diskr. Mat.,
2012
Number 4(18),
Pages
31–52
(Mi pdm387)
This article is cited in
7
papers
Mathematical Methods of Cryptography
Quasigroups and rings in coding theory and cryptography
V. T. Markov
,
A. V. Mikhalev
,
A. V. Gribov
,
P. A. Zolotykh
,
S. S. Skazhenik
M. V. Lomonosov Moscow State University, Moscow, Russia
Abstract:
Cryptoschemes and codes over associative and nonassociative algebraic structures are studied. A cryptoscheme over graded ring, a cryptoscheme over Moufang loop, a key agreement protocol, and linearly optimal codes are constructed.
Keywords:
nonassociative algebraic structure, graded ring, quasigroup ring, Moufang loop, commutator quasigroup, cryptoschemes, linearly optimal code.
UDC:
512.548.7
+
512.554
Fulltext:
PDF file (896 kB)
References
Cited by
©
Steklov Math. Inst. of RAS
, 2025