Nonassociative algebraic structures in cryptography and coding
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.
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 47663 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284417 (Why is no real title available?)
- scientific article; zbMATH DE number 775280 (Why is no real title available?)
- Loop codes
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
- Quasigroups and rings in coding theory and cryptography
- Reducing elliptic curve logarithms to logarithms in a finite field
- Searching for linear codes with large minimum distance
- On the nonbinary Johnson scheme
- Nonassociative algebras: some applications.
- On algebras of binary relations with conjunctive operations
- On groupoids of relations with one conjunctive operation of rank 2
- Generation of proper families of functions
- Efficient verification of polynomial completeness of quasigroups
- Some homomorphic cryptosystems based on nonassociative structures
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- Victor Timofeevich Markov (21.06.1948 -- 15.07.2019)
- Non-associative structures in homomorphic encryption
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 1912011 (Why is no real title available?)
- A construction of algebraic cryptosystem over the quasigroup ring
- The structure of finite group algebra of a semidirect product of abelian groups and its applications
- Subsystems and automorphisms of some finite magmas of order \(k+k^2\)
- Quasigroups and rings in coding theory and cryptography
- Quasi-invariant and invariant functionals and measures on systems of topological loops and quasigroups
- Quotient and transversal mappings for topological quasigroups
- Regular and complete spaces over topological quasigroups
- Decomposition of modules over generalized Dickson algebras
- On some universal criterion for a fixed point
- On relations between topological and algebraic structures of quasigroups
- Application of ternary quasigroups to string processing
- Polyadic T-quasigroups
This page was built for publication: Nonassociative algebraic structures in cryptography and coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199369)
