Related papers: MOR Cryptosystem and classical Chevalley groups in…

This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…

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…

Ab-initio Monte Carlo simulations of strongly-interacting fermionic systems are plagued by the fermion sign problem, making the non-perturbative study of many interesting regimes of dense quantum matter, or of theories of odd numbers of…

We present some variations on some of the main open problems on character degrees. We collect some of the methods that have proven to be very useful to work on these problems. These methods are also useful to solve certain problems on zeros…

We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness…

Two variations of the McEliece cryptosystem are presented. The first one is based on a relaxation of the column permutation in the classical McEliece scrambling process. This is done in such a way that the Hamming weight of the error, added…

The point of this paper is to use affine automorphisms from algebraic geometry to build cryptographic multivariate mappings. We will construct groups G,H, both isomorphic to the cyclic group with a prime number of elements and multilinear…

In this paper we propose cryptosystems based on subgroup distortion in hyperbolic groups. We also include concrete examples of hyperbolic groups as possible platforms.

The article explores the creation of a cryptosystem using a halidon group ring of a dihedral group. Due to the non-abelian nature of the group, constructing the cryptosystem is more challenging compared to an abelian group. The logic used…

We propose a symmetric key homomorphic encryption scheme based on the evaluation of multivariate polynomials over a finite field. The proposed scheme is somewhat homomorphic with respect to addition and multiplication. Further, we define a…

We present a novel use case for quantum computation: the sensitivity analysis for a risk model used at Deutsche B\"orse Group. Such an analysis is computationally too expensive to perform on classical computers. We show in detail how the…

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…

For the $p$-Sylow subgroups $U$ of the finite classical groups of untwisted Lie type, $p$ an odd prime, we construct a monomial $\mathbb C U$-module $M$ which is isomorphic to the regular representation of $\mathbb C G$ by a modification of…

Many modern asymmetric encryption methods rely on prime numbers, as they have distinctive properties. For instance, the security of RSA cryptosystem relies on the computational difficulty of factoring a large composite number in its prime…

Type-two constructions abound in cryptography: adversaries for encryption and authentication schemes, if active, are modeled as algorithms having access to oracles, i.e. as second-order algorithms. But how about making cryptographic schemes…

McEliece and Niederreiter cryptosystems are robust and versatile cryptosystems. These cryptosystems work with many linear error-correcting codes. They are popular these days because they can be quantum-secure. In this paper, we study the…

We prove a higher-dimensional Chevalley restriction theorem for orthogonal groups, which was conjectured by Chen and Ng\^{o} for reductive groups. In characteristic $p>2$, we also prove a weaker statement. In characteristic $0$, the theorem…

We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…

We formulate and prove relative versions of several classical decompositions known in the theory of Chevalley groups over commutative rings. As an application we obtain upper estimates for the width of principal congruence subgroups in…

In discrete logarithm based cryptography, a method by Pohlig and Hellman allows solving the discrete logarithm problem efficiently if the group order is known and has no large prime factors. The consequence is that such groups are avoided.…