Results 31 to 40 of about 98,739 (338)
Degree of orthomorphism polynomials over finite fields [PDF]
An orthomorphism over a finite field $\mathbb{F}_q$ is a permutation $θ:\mathbb{F}_q\mapsto\mathbb{F}_q$ such that the map $x\mapstoθ(x)-x$ is also a permutation of $\mathbb{F}_q$. The degree of an orthomorphism of $\mathbb{F}_q$, that is, the degree of the associated reduced permutation polynomial, is known to be at most $q-3$. We show that this upper
Jack Allsop, Ian M. Wanless
openaire +3 more sources
A note on permutation polynomials over finite fields [PDF]
Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, two conjectures on permutation polynomials proposed recently by Wu and Li [19] are settled ...
Jingxue Ma, G. Ge
semanticscholar +1 more source
The Applications of Algebraic Polynomial Rings in Satellite Coding and Cryptography [PDF]
This survey illustrates and investigates the application of polynomial rings over finite fields to generate PRN codes for Global Navigation Satellite System (GNSS) satellites.
Amir Bagheri, Hassan Emami
doaj +1 more source
Using zeta functions to factor polynomials over finite fields [PDF]
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.
B. Poonen
semanticscholar +1 more source
The additive index of polynomials over finite fields [PDF]
In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds on multiplicative character sums, and characterizations of permutation polynomials.
Lucas Reis, Qiang Wang 0012
openaire +3 more sources
Primitive polynomials with prescribed second coefficient [PDF]
The Hansen-Mullen Primitivity Conjecture (HMPC) (1992) asserts that, with some (mostly obvious) exceptions, there exists a primitive polynomial of degree n over any finite fieldwith any coefficient arbitrarily prescribed.
Cohen, Stephen D. +3 more
core +1 more source
On polynomial factorization over finite fields [PDF]
Let f ( x ) f(x)
Gunji, Hiroshi, Arnon, Dennis
openaire +1 more source
On Values of Cyclotomic Polynomials. V [PDF]
In this paper, we present three results on cyclotomic polynomials. First, we present results about factorization of cyclotomic polynomials over arbitrary fields K.
Motose, Kaoru, Kaoru Motose
core +1 more source
On the Planarity of Certain Dembowski-Ostrom Polynomials
Planar mappings, defined by Dembowski and Ostrom, are identified as a means to construct projective planes. Then, many important applications of planar mappings appear in different fields such as cryptography and coding theory.
Zehra Aksoy, Barış Bülent Kırlar
doaj +1 more source
The review on elliptic curves as cryptographic pairing groups [PDF]
Elliptic curve is a set of two variable points on polynomials of degree 3 over a field acted by an addition operation that forms a group structure. The motivation of this study is the mathematics behind that elliptic curve to the applicability within a ...
E Khamseh
doaj +1 more source

