相关论文: A note on factorisation of division polynomials

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

This paper addresses the topic of equidistribution and recurrence for polynomial sequences over function fields. The main focus is to note and correct two small errors in [V. Bergelson and A. Leibman, A Weyl-type equidistribution theorem in…

In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…

Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for…

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…

Following work of Mazur-Tate and Satoh, we extend the definition of division polynomials to arbitrary isogenies of elliptic curves, including those whose kernels do not sum to the identity. In analogy to the classical case of division…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

This paper addresses an investigation on a factorization method for difference equations. It is proved that some classes of second order linear difference operators, acting in Hilbert spaces, can be factorized using a pair of mutually…

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…

An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…

We show that the effective factorization of Ore polynomials over $\mathbb{F}_q(t)$ is still an open problem. This is so because the known algorithm in [1] presents two gaps, and therefore it does not cover all the examples. We amend one of…

In 2005, Kayal suggested that Schoof's algorithm for counting points on elliptic curves over finite fields might yield an approach to factor polynomials over finite fields in deterministic polynomial time. We present an exposition of his…

We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split…

Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…