相关论文: Natural representations of black box groups encryp…

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 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.

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…

The paper proposes a new and systematic approach to the so-called black box group methods in computational group theory. As the starting point of our programme, we construct Frobenius maps on black box groups of untwisted Lie type in odd…

A deterministic polynomial-time algorithm constructs an isomorphism between ${\rm PGL}(2,2^e)$ and a black box group to which it is isomorphic.

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…

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.…

We construct the finite-dimensional continuous complex representations of $\mathrm{SL}_2$ over compact discrete valuation rings of even residual characteristic. We also prove that the complex group algebras of $\mathrm{SL}_2$ over finite…

Let $q$ be a prime power and let $G$ be an absolutely irreducible subgroup of $GL_d(F)$, where $F$ is a finite field of the same characteristic as $\F_q$, the field of $q$ elements. Assume that $G \cong G(q)$, a quasisimple group of…

We propose a polynomial time $f$-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over $\mathbb{F}_q$) for computing an isomorphism (if there is any) of a finite dimensional…

We show that algebraic analogues of universal group covers, surjective group homomorphisms from a $\mathbb{Q}$-vector space to $F^{\times}$ with "standard kernel", are determined up to isomorphism of the algebraic structure by the…

Let $\mathbb{F}$ be a field and let $E$ be the natural representation of $\mathrm{SL}_2(\mathbb{F})$. Given a vector space $V$, let $\Delta^{(2,1^{N-1})}V$ be the kernel of the multiplication map $\bigwedge^N V \otimes V \rightarrow…

Let f be an arbitrary positive integer valued function. The goal of this note is to show that one can construct a finitely generated group in which the discrete log problem is polynomially equivalent to computing the function f. In…

Since 1870s, scientists have been taking deep insight into Lie groups and Lie algebras. With the development of Lie theory, Lie groups have got profound significance in many branches of mathematics and physics. In Lie theory, exponential…

We propose a public key encryption cryptosystem based on solutions of linear equation systems with predefinition of input parameters through shared secret computation for factorizable substitutions. The existence of multiple equivalent…

This paper provides an example of structural proxies for black box rings encrypting rings of 2 by 2 matrices of finite fields of odd order.

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…

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $W_{2}(\mathbb{F}_{q})$ be the ring of Witt vectors of length two over $\mathbb{F}_{q}$. We prove that for any reductive group scheme $\mathbb{G}$ over $\mathbb{Z}$ such…

This paper introduces a newly developed private key cryptosystem and a public key cryptosystem. In the first one, each letter is encrypted with a different key. Therefore, it is a kind of a one-time pad. The second one is inspired by the…

Let $F$ be a nonarchimedean local field of characteristic zero and let SL(N) = SL(N,F). This article is devoted to studying the influence of the elliptic representations of SL(N) on the $K$-theory. We provide full arithmetic details. This…