Nonassociative algebraic structures in cryptography and coding (Q2199369): Difference between revisions

From the text: In this review, we consider applications of nonassociative algebraic structures for the construction of linearly optimal codes and cryptosystems. In the Introduction, the main concepts and statements necessary for further presentation are given. Section 2 describes the construction of two families of linearly optimal \([n, n-3, 3]_q\)-codes for \(n = 2q\) and \(n = 2q - 2\) using quasigroup rings. To construct \([2q, 2q - 3, 3]_q\)-codes, we use the representation of Reed-Solomon codes as ideals of the group ring \(\mathbb F_{p^n}G\), where \(G\) is a \(p\)-elementary Abelian group of order \(p^n\). We define the commutator quasigroups and present linearly optimal codes that are constructed with the help of commutator quasigroups for the dihedral group \(D_n\). In Sec. 3, we construct a cryptoscheme over a graded ring with a multiplicative basis. This generalizes the construction of a cryptosystem over a group ring. In this case, the ambiguity of the choice of grading and multiplicative basis extends the set of suitable algebraic structures for encryption. In Sec. 4, a protocol of a common secret key generation and a cryptoscheme are constructed, where all calculations are performed in the Moufang loop. In Sec. 5, we introduce the notion of a groupoid with permutational degrees (CP-groupoid), and we describe the protocol for generating a shared secret key, similar to the Diffie-Hellman algorithm, based on CP-groupoids, as well as some constructions of CP-groupoids.