Related papers: Fifty shades of black
The present paper proposes a new and systematic approach to the so-called black box group methods in computational group theory. Instead of a single black box, we consider categories of black boxes and their morphisms. This makes new…
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…
For the black box groups $X$ encrypting ${\rm{PGL}}_2(q)$, $q$ odd, we propose an algorithm constructing a subgroup encrypting ${\rm{Sym}}_4$ and subfield subgroups of $X$. We also present the analogous algorithms for black box groups…
A deterministic polynomial-time algorithm constructs an isomorphism between ${\rm PGL}(2,2^e)$ and a black box group to which it is isomorphic.
If a black box group is known to be isomorphic to an exceptional simple group of Lie type of (twisted) rank $>1$, other than any $^2F_4(q)$, over a field of known size, a Las Vegas algorithm is given to produce a constructive isomorphism.…
The main component of (constructive) recognition algorithms for black box groups of Lie type in computational group theory is the construction of unipotent elements. In the existing algorithms unipotent elements are found by random search…
Given a black box group $\mathsf{Y}$ encrypting $\rm{PSL}_2(\mathbb{F})$ over an unknown field $\mathbb{F}$ of unknown odd characteristic $p$ and a global exponent $E$ for $\mathsf{Y}$ (that is, an integer $E$ such that $\mathsf{y}^E=1$ for…
We present a polynomial time Monte-Carlo algorithm for finite simple black box classical groups of odd characteristic which constructs all root ${\rm{SL}}_2(q)$-subgroups associated with the nodes of the extended Dynkin diagram of the…
We briefly explain how to implement the morphisms in our paper ``Natural representations of black box groups encrypting $SL_2(\mathbb{F})$" and provide some examples.
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…
We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor's algorithms for period finding and discrete log as subroutines. Thus proposed cryptosystems based on the presumed hardness of discrete…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
We describe the classification of ranked definably quasi-Frobenius groups of odd type : dihedral configurations are isomorphic to PGL(2, K) for K an algebraically closed field of characteristic other than two; Frobenius groups are spilt and…
We discuss rather systematically the principle, implicit in earlier works, that for a "random" element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic…
This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…
This work presents a new, simple O(log^2|G|) algorithm, the Fibonacci cube algorithm, for producing random group elements in black box groups. After the initial O(log^2|G|) group operations, epsilon-uniform random elements are produced…
In this paper, we identify many important properties and develop criteria for the existence of subquasigroups in finite quasigroups. Based on these results, we propose an effective method that concludes the nonexistence of subquasigroup of…
Let $n$ be a positive integer and let $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $q$ is a power of a prime. This paper introduces a natural action of the Projective Semilinear Group $\text{P}\Gamma \text{L}(2,…
We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…
By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…