Related papers: Constructing Cryptographic Multilinear Maps Using …

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…

This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…

This paper studies separating invariants of finite groups acting on affine varieties through automorphisms. Several results, proved by Serre, Dufresne, Kac-Watanabe and Gordeev, and Jeffries and Dufresne exist that relate properties of the…

For an affine spherical homogeneous space G/H of a connected semisimple algebraic group G, we consider the factorization morphism by the action on G/H of a maximal unipotent subgroup of G. We prove that this morphism is equidimensional if…

For a given finite dimensional Hopf algebra $H$ we describe the set of all equivalence classes of cocycle deformations of $H$ as an affine variety, using methods of geometric invariant theory. We show how our results specialize to the…

To any nilpotent group of class n, one can associate a non-interactive key exchange protocol between n+1 users. The multilinear commutator maps associated to nilpotent groups play a key role in this protocol. In the present paper, we…

In this work we present an algorithm with which any arbitrary cubic planar map may be constructed through successive edge insertion while simultaneously constructing a set of proper edge labels and Hamiltonian cycles for each configuration.…

Invariance and equivariance to geometrical transformations have proven to be very useful inductive biases when training (convolutional) neural network models, especially in the low-data regime. Much work has focused on the case where the…

Let $G$ be an affine algebraic group over an algebraically closed field $k$ of characteristic zero. In this paper, we consider finite $G$-equivariant morphisms $F:X\to Y$ of irreducible affine $G$-varieties. First we determine under which…

The nonrecursive Bernstein-Vazirani algorithm was the first quantum algorithm to show a superpolynomial improvement over the corresponding best classical algorithm. Here we define a class of circuits that solve a particular case of this…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

In this work the algorithms of fast multiplication of matrices are considered. To any algorithm there associated a certain group of automorphisms. These automorphism groups are found for some well-known algorithms, including algorithms of…

We develop a method to construct elusive functions using techniques of commutative algebra and algebraic geometry. The key notions of this method are elusive subsets and evaluation mappings. We also develop the effective elimination theory…

Homomorphic encryption has largely been studied in context of public key cryptosystems. But there are applications which inherently would require symmetric keys. We propose a symmetric key encryption scheme with fully homomorphic evaluation…

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

One of the major open problems in symmetric cryptanalysis is to discover new specif i c types of invariant properties which can hold for a larger number of rounds of a block cipher. We have Generalised Linear Cryptanalysis (GLC) and…

In recent work on holomorphic maps that are symmetric under certain complex reflection groups---generated by complex reflections through a set of hyperplanes, the author announced a general conjecture related to reflection groups. The claim…

We propose a new homomorphic public-key cryptosystem over arbitrary nonidentity finite group based on the difficulty of the membership problem for groups of integer matrices. Besides, a homomorphic cryptosystem is designed for the first…

In this paper, algorithms for multivariate public key cryptography and digital signature are described. Plain messages and encrypted messages are arrays, consisting of elements from a fixed finite ring or field. The encryption and…

We show that Automorphic Lie Algebras which contain a Cartan subalgebra with a constant spectrum, called hereditary, are completely described by 2-cocycles on a classical root system taking only two different values. This observation…