Related papers: MOR Cryptosystem and classical Chevalley groups in…
We present a generalisation of the sifting procedure introduced originally by Sims for computation with finite permutation groups, and now used for many computational procedures for groups, such as membership testing and finding group…
The Hill cipher is a classical symmetric encryption algorithm that succumbs to the know-plaintext attack. Although its vulnerability to cryptanalysis has rendered it unusable in practice, it still serves an important pedagogical role in…
We characterize Cohen-Macaulay and Gorenstein rings obtained from certain types of convex body semigroups. Algorithmic methods to check if a polygonal or circle semigroup is Cohen-Macaulay/Gorenstein are given. We also provide some families…
We present a method of coding general self-similar structures. In particular, we construct a symmetry group of a one-dimensional Thue-Morse quasicrystal, i.e., of a nonperiodic ground state of a certain translation-invariant, exponentially…
We describe the ring of invariants for the finite orthogonal groups in odd dimension and even characteristic acting on the defining representation. We construct a minimal algebra generating set and describe the relations among the…
The paper contains versions of the Strong Embedding Theorem and the Uniqueness Subgroup Theorem for groups of finite Morley rank and odd type which are needed for the study of permutations actions and modules in the finite Morley rank…
A new asymmetric cryptosystem based on the Integer Factorization Problem is proposed. It posses an encryption and decryption speed of $O(n^2)$, thus making it the fastest asymmetric encryption scheme available. It has a simple mathematical…
Given a global exponent $E$ for a black box group $\mathsf{Y}$ encrypting ${\rm SL}_2(\mathbb{F})$, where $\mathbb{F}$ is an unknown finite field of unknown odd characteristic, we construct, in probabilistic time polynomial in $\log E$, the…
Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special,…
Public-key cryptosystems are suggested based on invariants of groups. We give also an overview of the known cryptosystems which involve groups.
Given an integer $M\geq 2$, we deploy the generating function techniques to compute the number of $M$-th roots of identity in some of the well-known finite groups of Lie type, more precisely for finite general linear groups, symplectic…
In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic complexity for the…
The Bivariate Function Hard Problem (BFHP) has been in existence implicitly in almost all number theoretic based cryptosystems. This work defines the BFHP in a more general setting and produces an efficient asymmetric cryptosystem. The…
In this paper, some zeros and non-zeros in the character tables of symmetric groups are displayed in the partition forms. In particular, more zeros of self conjugate partitions beside odd permutations are heavily investigated.
We construct an equivariant version of discrete Morse theory for simplicial complexes endowed with group actions. The key ingredient is a 2-categorical criterion for making acyclic partial matchings on the quotient space compatible with an…
This paper investigates the Jordan--Kronecker invariant of finite dimensional complex Lie algebras. We present an explicit algorithm for determining the type of a given Lie algebra from its Jordan--Kronecker invariant. The algorithm is…
We define a translation based cipher over an arbitrary finite field, and study the permutation group generated by the round functions of such a cipher. We show that under certain cryptographic assumptions this group is primitive. Moreover,…
In this work, we introduce a novel variant of the multivariate quadratic problem, which is at the core of one of the most promising post-quantum alternatives: multivariate cryptography. In this variant, the solution of a given multivariate…
We consider high-dimensional asset price models that are reduced in their dimension in order to reduce the complexity of the problem or the effect of the curse of dimensionality in the context of option pricing. We apply model order…
In this paper we present a new class of convolutional codes that admits an efficient al- gebraic decoding algorithm. We study some of its properties and show that it can decode interesting sequences of errors patterns. The second part of…