Results 61 to 70 of about 479 (179)

TORSION GALOIS REPRESENTATIONS OVER CM FIELDS AND HECKE ALGEBRAS IN THE DERIVED CATEGORY

Forum of Mathematics, Sigma, 2016
We construct algebras of endomorphisms in the derived category of the cohomology of arithmetic manifolds, which are generated by Hecke operators. We construct Galois representations with coefficients in these Hecke algebras and apply this technique to ...
JAMES NEWTON, JACK A. THORNE
doaj   +1 more source

CONVEYOR ANALOG OF MATRIX DIFFIE-HELLMAN PROOTOKOL

Ìнформаційні технології в освіті, 2013
A variant of the construction of the matrix analog of Diffie-Hellman based on pipelined binary update secret element used to generate the secret key encryption legalized subscribers open network.
A.J. Beletsky, А.А. Beletsky
doaj  

On local Galois deformation rings: generalised reductive groups

Forum of Mathematics, Pi
We study deformation theory of mod p Galois representations of p-adic fields with values in generalised reductive group schemes, such as L-groups and C-groups.
Vytautas Paškūnas, Julian Quast
doaj   +1 more source

LOCAL EXTENSIONS WITH IMPERFECT RESIDUE FIELD

Ural Mathematical Journal, 2019
The paper deals with some aspects of general local fields and tries to elucidate some obscure facts. Indeed, several questions remain open, in this domain of research, and literature is getting scarce.
Akram Lbekkouri
doaj   +1 more source

A Spatial Analog of the Compass Rose Constructed Using Galois Fields

Computation
This paper proposes a spatial analog of the compass rose, constructed using finite fields and the discrete logarithm operation. The basic idea is to match the geometric elements of regular and semiregular polyhedra with elements of Galois fields (GF ...
Ibragim Suleimenov, Akhat Bakirov
doaj   +1 more source

PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS

Ìнформаційні технології в освіті, 2014
In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS) with a maximum length with acceptable statistical characteristics.
A. Beletsky, E. Beletsky
doaj  

Algorithm for Obtaining Complete Irreducible Polynomials over Given Galois Field for New Method of Digital Monitoring of Information Space

Computers
Irreducible polynomials are widely used in modern cryptography; however, algorithms for finding such polynomials remain quite complex and require significant computational resources.
Dina Shaltykova, Aliya Massalimova, Yelizaveta Vitulyova, Ibragim Suleimenov   +3 more
doaj   +1 more source

Quasifinite fields of prescribed characteristic and Diophantine dimension

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
Let ℙ be the set of prime numbers, ℙ the union ℙ ∪ {0}, and for any field E, let char(E) be its characteristic, ddim(E) the Diophantine dimension of E, 𝒢E the absolute Galois group of E, and cd(𝒢E) the Galois cohomological dimension 𝒢E.
Chipchakov Ivan D., Paunov Boyan B.
doaj   +1 more source

Ricerche di matematica con Giuseppina Varone

Science & Philosophy, 2013
In memory of the researcher Pina Varone, I present the research carried out together for over 20 years. Some relevant issues and applicants were: the connection between teaching and research, and as an in-depth teaching emerge new research topics; the ...
Antonio Maturo
doaj  

Probabilistic Galois theory in function fields

Finite Fields and Their Applications
We study the irreducibility and Galois group of random polynomials over function fields. We prove that a random polynomial $f=y^n+\sum_{i=0}^{n-1}a_i(x)y^i\in\mathbb F_q[x][y]$ with i.i.d coefficients $a_i$ taking values in the set $\{a(x)\in\mathbb{F}_q[x]: \mathrm{deg}\, a\leq d\}$ with uniform probability, is irreducible with probability tending to $
Alexei Entin, Alexander Popov
openaire   +3 more sources