Results 11 to 20 of about 1,050,138 (224)
On Some Computational and Applications of Finite Fields
Finite field is a wide topic in mathematics. Consequently, none can talk about the whole contents of finite fields. That is why this research focuses on small content of finite fields such as polynomials computational, ring of integers modulo p where p ...
Jean Pierre Muhirwa
doaj +1 more source
The Tate conjecture for K3 surfaces over finite fields [PDF]
Artin's conjecture states that supersingular K3 surfaces over finite fields have Picard number 22. In this paper, we prove Artin's conjecture over fields of characteristic p>3.
A. Beauville +32 more
core +3 more sources
Discrete logarithm problem in matrix
In this paper the discrete logarithm problem in matrix in finite fields is formulated, possible ways of solution are given.
Povilas Tvarijonas +2 more
doaj +3 more sources
Associative nil-algebras over finite fields [PDF]
The nilpotency degree of a relatively free finitely generated associative algebra with the identity $x^n=0$ is studied over finite fields.Comment: 12 ...
Artem A. Lopatin, Ivan, P. Shestakov
core +1 more source
THEORETICAL ASSUMPTIONS FOR AN INTRODUCTION TO ELLIPTIC CURVE CRYPTOGRAPHY
Understanding elliptic curves contributed to solving mathematical problems in number theory that had been unsolved for centuries. Elliptic curves were also used in solving one of the millennial problems, which is Fermat's last theorem.
Ognjen Milivojević, Boris Damjanović
doaj +1 more source
On Fields with Finite Information Density [PDF]
The existence of a natural ultraviolet cutoff at the Planck scale is widely expected. In a previous Letter, it has been proposed to model this cutoff as an information density bound by utilizing suitably generalized methods from the mathematical theory ...
A. Kempf +25 more
core +1 more source
Subspace Codes Based on Partial Injective Maps of Vector Spaces Over Finite Fields
Subspace codes are widely used in error corrections of random network coding. In this article, subspace codes based on partial injective maps of vector spaces over finite fields are considered. Several bounds of the subspace codes (n, M, 2b, e)q based on
Hong-Li Wang, Gang Wang, You Gao
doaj +1 more source
Summary We continue the formalization of field theory in Mizar. Here we prove existence and uniqueness of finite fields by constructing the splitting field of the polynomial X(pn) −X over the prime field of a field with characteristic p.
Louis Halle Rowen, Uzi Vishne
openaire +3 more sources
Matrix powers over finite fields
Let GF(q) denote the finite field of order q=pe with p odd. Let M denote the ring of 2×2 matrices with entries in GF(q). Let n denote a divisor of q−1 and assume 2≤n and 4 does not divide n.
Maria T. Acosta-De-Orozco +1 more
doaj +1 more source
The radical factors of f(x)−f(y) over finite fields
Let F denote the finite field of order q For f(x) in F[x], let f*(x,y) denote the substitution polynomial f(x)−f(y). The polynomial f*(x,y) has frequently been used in questions on the values set of f(x) In this paper we consider the irreducible factors ...
Javier Gomez-Calderon
doaj +1 more source

