Results 21 to 30 of about 3,324,527 (305)
Matrix powers over finite fields
International Journal of Mathematics and Mathematical Sciences, 1992 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
Explicit maximal and minimal curves over finite fields of odd characteristics [PDF]
, 2015 In this work we present explicit classes of maximal and minimal Artin-Schreier type curves over finite fields having odd characteristics. Our results include the proof of Conjecture 5.9 given in [1] as a very special subcase.
Özbudak, Ferruh +2 more
core +1 more source
Asymptotically good towers of function fields with small p-rank [PDF]
, 2021 Over any quadratic finite field we construct function fields of large genus that have simultaneously many rational places, small p-rank, and many ...
Anbar Meidl, Nurdagül +7 more
core +1 more source
The radical factors of f(x)−f(y) over finite fields
International Journal of Mathematics and Mathematical Sciences, 1997 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
Arithmetic in a finite field [PDF]
Mathematics of Computation, 1980 An algorithm for realizing finite field arithmetic is presented. The relationship between linear recursions and polynomial arithmetic (modulo a fixed polynomial) over Zp is exploited to reduce the storage and computation requirements of the algorithm.
openaire +1 more source
Isomorphism classes of elliptic and hyperelliptic curves over finite fields F((2g+1))n
, 2019 We give the number and representatives of isomorphism classes of hyperelliptic curves of genus g defined over finite fields F(2g+1)n, g=1,2,3.
Jeong, E, Choie, Y
core +2 more sources
On permutation polynomials over finite fields
International Journal of Mathematics and Mathematical Sciences, 1987 A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a ...
R. A. Mollin, C. Small
doaj +1 more source
Computation with finite fields
Information and Control, 1963 A technique for systematically generating representations of finite fields is presented. Relations which must be physically realized in order to implement a parallel arithmetic unit to add, multiply, and divide elements of finite fields of 2n elements are obtained.
Thomas C. Bartee, David I. Schneider
openaire +1 more source
Strict avalanche criterion over finite fields
Journal of Mathematical Cryptology, 2007 Boolean functions which satisfy the Strict Avalanche Criterion (SAC) play an important role in the art of information security. In this paper, we extend the concept of SAC to finite fields GF(p).
Li Yuan, Cusick T. W.
doaj +1 more source
Finite H_v-Fields with Strong-Inverses
Ratio Mathematica, 2017 The largest class of hyperstructures is the class of H v -structures. This is the class of hyperstructures where the equality is replaced by the non-empty intersection.
Theodora Kaplani, Thomas Vougiouklis
doaj +1 more source