Related papers: Some applications of arithmetic groups in cryptogr…
We develop matrix cryptography based on linear recurrent sequences of any order that allows securing encryption against brute force and chosen plaintext attacks. In particular, we solve the problem of generalizing error detection and…
Distortion maps are a useful tool for pairing based cryptography. Compared with elliptic curves, the case of hyperelliptic curves of genus g > 1 is more complicated since the full torsion subgroup has rank 2g. In this paper we prove that…
A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…
Nowadays, using cryptographic systems play an effective role in security and safety technologies. One of the most applied kind of cryptography is Symmetric Cryptography and its applications. New aspects of symmetric Cryptography…
This article proposes the use of pseudorandom decimal sequences that have gone through an additional random mapping for the design of cryptographic keys. These sequences are generated by starting with inverse prime expansions in base 3 and…
We use the notion of the principal three-dimensional subgroup of a simple Lie group to identify certain special subspaces of the Lie algebra and address the question of whether these are calibrated for invariant forms on the group.
We introduce a new tool for the study of isogeny-based cryptography, namely pairings which are sesquilinear (conjugate linear) with respect to the $\mathcal{O}$-module structure of an elliptic curve with CM by an imaginary quadratic order…
Sometimes it is possible to embed an algebraic trapdoor into a block cipher. Building on previous research, in this paper we investigate an especially dangerous algebraic structure, which is called a hidden sum and which is related to some…
This scholarly work presents an advanced cryptographic framework utilizing automorphism groups as the foundational structure for encryption scheme implementation. The proposed methodology employs a three-parameter group construction,…
We discuss examples of linear representations of finite groups as subgroups of the Riordan group. In particular, we show that the symmetric group of degree three has no faithful representation as a subgroup of the Riordan group over the…
A new scheme of probabilistic subgroup-related encryption is introduced. Some applications of this scheme based on the RSA, Diffie-Hellman and ElGamal encryption algorithms are described. Security assumptions and main advantages of this…
It is described the group of arrowy permutations (that is extension of symmetric group) and the consequent process of generation of GL(n) and some its subgroups by this combinatoric group and its subgroups.
We show that many known schemes of the public key exchange protocols in the algebraic cryptography, that use two-sided multiplications, are the specific cases of the general scheme of such type. In most cases, such schemes are built on…
In this paper we propose right-angled Artin groups as a platform for secret sharing schemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we define two…
Let $[n]=\{1,\ldots,n\}$ be the $n$-chain. We give presentations for the following transformation semigroups: the semigroup of full order-decreasing mappings of $[n]$, the semigroup of partial one-to-one order-decreasing mappings of $[n]$,…
This short note investigates the effects of using expansions to the base of -2. The main applications we have in mind are cryptographic protocols, where the crucial operation is computation of scalar multiples. For the recently proposed…
We give an exposition of the hidden subgroup problem for dihedral groups from the point of view of the standard hidden subgroup quantum algorithm for finite groups. In particular, we recall the obstructions for strong Fourier sampling to…
We give a generalisation of the Lenstra-Lenstra-Lov\'asz (LLL) lattice-reduction algorithm that is valid for an arbitrary (split, semisimple) reductive group $G$. This can be regarded as `lattice reduction with symmetries'. We make this…
In this paper we give a construction for a special type of congruences on commutative semigroups. We apply our result for the multiplicative semigroup of all positive integers.
We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic field. The algorithms used incorporate improvements over previously-used…