Primitive normal values of rational functions over finite fields

For [Formula: see text] ([Formula: see text]), denote by [Formula: see text] the finite field of order [Formula: see text] and for a positive integer [Formula: see text], let [Formula: see text] be its extension field of degree [Formula: see text]. We establish a sufficient condition for existence of a primitive normal element [Formula: see text] such that [Formula: see text] is a primitive element, where [Formula: see text], with [Formula: see text] satisfying [Formula: see text] in [Formula: see text].

This paper introduces a novel method for selecting parameters of finite fields formed by 2 × 2 matrices over a finite field of integers modulo a prime p. The method aims to simultaneously determine both the field parameters and primitive elements, thereby optimizing the construction of cryptographic algorithms. The proposed approach leverages the properties of quadratic residues and non-residues, simplifying the process of finding matrix field parameters while maintaining computational efficiency. The method is particularly effective when the prime number p is either a Mersenne prime or (p + 1)/2 is also a prime. This study demonstrates that the resulting matrix fields can be practically computed, offering a high degree of flexibility for cryptographic protocols such as key agreement and secure data transmission. Compared to previous methods, the new method reduces the parameter search space and provides a structured way to identify primitive elements without the need for a separate search procedure. The findings have significant implications for the development of efficient cryptographic systems using matrix-based finite fields.

Reconstructing rational functions with FireFly

The fundamental theorem of algebra states that every non-constant polynomial with complex coefficients can be factorized on linear factors with coefficients from the same field. However, this is not true for numerous other equally important and interesting fields such as, for example, finite fields. All existing finite fields are of the q=pk order, where p is a prime number and k is a positive integer. Any two finite fields of the same order are mutually isomorfic, therefore the field of q order is unique; it is also known as »the Galois field«, named after the French mathematician Evariste Galois (1811-1832). This thesis deals with factorization of polynomials over finite fields. The general rule states that some polynomials are not reducible, yet each polynomial with coefficients of the field can be uniquely factorized into irreducible factors. There are various known algorithms that can determine whether or not a polynomial is reducible and – in the case of reducible polynomials – also find this factorization. There are several such algorithms, however, this thesis shall focus on the Berlekamp's algorithm. The introductory chapter introduces the historical development of the various approaches to polynomial factorization and presents some modern applications that are currently in use. The second chapter focuses on basic concepts and characteristics of algebraic structures and some classic results that are crucial for the understanding of the algorithm (e.g. groups, rings, fields, division rings and polynomial rings.). The algorithm also uses the Chinese remainder theorem for polynomials and Euclidean algorithm for calculating the greatest common divisor of two polynomials. The first part of Chapter 3 (i.e. the main chapter of the thesis) demonstrates 4 naive methods for the finding of polynomial factorization. For each of the methods we first introduced factorization of a polynomial over real numbers and then continued with an example of a polynomial with coefficients in the finite field. The sieve method, for instance, builds a list of irreducible polynomials of low degrees. Irreducible polynomials up to (and including) degree 6 over the finite fields Z2, Z3, Z5 and Z7 can be calculated using our own code made in the VisualC# programming language. These naive methods are followed by a detailed description of the Berlekamp's algorithm with theorems, proofs and various examples. At the end of section we present our implementation of the algorithm in the computational algebra system MAGMA.

Let \( \mathbb{F}_q \) be a finite field with q elements, where q is a prime power. Let G be a subgroup of the general linear group over \( \mathbb{F}_q \) and \( \mathbb{F}_q \) be the rational function field over \( \mathbb{F}_q \). We seek to understand the structure of the rational invariant subfield \( \mathbb{F}_q \). In this paper, we prove that \( \mathbb{F}_q \) is rational (or, purely transcendental) by giving an explicit set of generators when G is the symplectic group. In particular, the set of generators we gave satisfies the Dickson property.

We study the minimal number of ramified primes in Galois extensions of rational function fields over finite fields with prescribed finite Galois group. In particular, we obtain a general conjecture in analogy with the well studied case of number fields, which we establish for abelian, symmetric, and alternating groups in many cases.

An Algorithm to Find Square Root of Quadratic Residues over Finite Fields using Primitive Elements

Autocorrelation Function of a Family of Complex Sequences

Rational functions over finite fields having continued fraction expansions with linear partial quotients

In this article, we establish a sufficient condition for the existence of a primitive element such that for any matrix of rank 2, the element is a primitive element of and , for any prescribed , where for some positive integer k. We establish existence of such elements for all pairs except for finitely many pairs.

1. Statement of results We let F be the finite field with two elements, and let K be the field F((x')) of all formal power series in x-' over F. Every element of K not in the field of rational functions F(x) has a unique infinite continued fraction expansion f = a. + 1/(al + 1/(a2 + * * *)), or more briefly f = [a0; a,, a2, * *.* ],

Let 𝔽q stand for the finite field of odd characteristic p with q elements (q = pn, n ∈ ℕ) and [Formula: see text] denote the set of all the nonzero elements of 𝔽q. Let m and t be positive integers. By using the Smith normal form of the exponent matrix, we obtain a formula for the number of rational points on the variety defined by the following system of equations over [Formula: see text] where the integers t > 0, r0 = 0 < r1 < r2 < ⋯ < rt, 1 ≤ n1 < n2 <, ⋯ < nt and 0 ≤ j ≤ t − 1, bk ∊ 𝔽q, ak,i ∊ [Formula: see text] (k = 1, …, m, i = 1, …, rt), and the exponent of each variable is a positive integer. Further, under some natural conditions, we arrive at an explicit formula for the number of 𝔽q-rational points on the above variety. It extends the results obtained previously by Wolfmann, Sun, Wang, Hong et al. Our result gives a partial answer to an open problem raised in [The number of rational points of a family of hypersurfaces over finite fields, J. Number Theory 156 (2015) 135–153].

Let G be a simple connected graph with r vertices and t edges. Let d be a positive integer and \(a\in F_{p^n}^{*}\). The associated system of equations S(G, d, p n , a) of G over a finite field \(F_{p^n}^{*}\) is defined to be AX = C, where \(X = (x^d_1, x^d_2,...,x^d_t)^{\top}\), C = (a, a, ..., a) ⊤ , A = (a ij ) is the incidence matrix of G. We show that the solutions of S(G, d, p n , a) has a relation with the number of perfect matchings of G. We also show that the problem of determining the number of solutions to a system of equations over finite field is NP-hard.

Polyadic constacyclic codes over finite fields have been of interest due to their nice algebraic structures, good parameters, and wide applications. Recently, the study of Type-I m-adic constacyclic codes over finite fields has been established. In this paper, a family of Type-II m-adic constacyclic codes is investigated. The existence of such codes is determined using the length of orbits in a suitable group action. A necessary condition and a sufficient condition for a positive integer s to be a multiplier of a Type-II m-adic constacyclic code are determined. Subsequently, for a given positive integer m, a necessary condition and a sufficient condition for the existence of Type-II m-adic constacyclic codes are derived. In many cases, these conditions become both necessary and sufficient. For the other cases, determining necessary and sufficient conditions is equivalent to the discrete logarithm problem which is considered to be computationally intractable. Some special cases are investigated together with examples of Type-II polyadic constacyclic codes with good parameters.

Let K = ¥q(T the rational function field over the finite field ¥q (T: indeterminate), and A=¥q[T]. For a non-zero ideal n of A, we can define a smooth proper geometrically connected curve X0(n) over K, called the Drinfeld modular curve of Hecke type with conductor n. In this article, we define the Eisenstein quotient J of the Jacobian variety / of Jf0(n) for n maximal and investigate its arithmetic properties. One of the main results is as follows :