Related papers: Some applications of arithmetic groups in cryptogr…
We develop the structure theory of symplectic Lie groups based on the study of their isotropic normal subgroups. The article consists of three main parts. In the first part we show that every symplectic Lie group admits a sequence of…
This paper presents some new Lie groups preserving fixed subspaces of geometric algebras (or Clifford algebras) under the twisted adjoint representation. We consider the cases of subspaces of fixed grades and subspaces determined by the…
We introduce the notion of an oriented Steiner quasigroup and develop elements of a relevant algebraic apparatus. The approach is based upon (modified) Schreier-type $f$-extensions for quasigroups (cf. earlier works \cite{S, NSt, NSt2})…
It is well-known that the linear secret-sharing scheme (LSSS) can be constructed from linear error-correcting codes (Brickell [1], R.J. McEliece and D.V.Sarwate [2],Cramer, el.,[3]). The theory of linear codes from algebraic-geometric…
Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…
This paper presents new properties of Primitive Pythagorean Triples (PPT) that have relevance in applications where events of different probability need to be generated and in cryptography.
Separable coordinate systems are introduced in the complex and real four-dimensional flat spaces. We use maximal Abelian subgroups to generate coordinate systems with a maximal number of ignorable variables. The results are presented (also…
In this paper we discuss the Hidden Subgroup Problem (HSP) in relation to post-quantum group-based cryptography. We review the relationship between HSP and other computational problems discuss an optimal solution method, and review the…
Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…
We propose modifications of known quasigroup based stream ciphers. Systems of orthogonal n-ary groupoids are used.
In this paper homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarithmic depth its encrypted simulation of a polynomial size over…
Difference sets are basic combinatorial structures that have applications in signal processing, coding theory, and cryptography. We consider the problem of identifying a shifted version of the characteristic function of a (known) difference…
In this survey, we report on the state of the art of some of the fundamental problems in the Lie theory of Lie groups modeled on locally convex spaces, such as integrability of Lie algebras, integrability of Lie subalgebras to Lie…
In this paper, we study the structure of the permutability graphs of subgroups, and the permutability graphs of non-normal subgroups of the following groups: the dihedral groups $D_n$, the generalized quaternion groups $Q_n$, the…
This article presents a method for enhancing the encryption algorithm in the MST3 cryptosystem for generalized Suzuki 2-groups. The conventional MST cryptosystem based on Suzuki groups utilizes logarithmic signatures (LS) restricted to the…
We consider a family of 2-step nilpotent Lie algebras associated to uniform complete graphs on odd number of vertices. We prove that the symmetry group of such a graph is the holomorph of the additive cyclic group $\Z_n$. Moreover, we prove…
We give an algorithm which produces a unique element of the Clifford group $\mathcal{C}_n$ on $n$ qubits from an integer $0\le i < |\mathcal{C}_n|$ (the number of elements in the group). The algorithm involves $O(n^3)$ operations. It is a…
The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…
Civino et al. (2019) have shown how some diffusion layers can expose a Substitution-Permutation Network to vulnerability from differential cryptanalysis when employing alternative operations coming from groups isomorphic to the translation…
The method of range decreasing group homomorphisms can be applied to study various maps between mapping spaces, includin holomorphic maps, group homomorphisms, linear maps, semigroup homomorphisms, Lie algebra homomorphisms and algebra…