Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field
We analyse the behaviour of the Euclidean algorithm applied to pairs ( g , f ) of univariate nonconstant polynomials over a finite field $\mathbb{F}_{q}$ of q elements when the highest degree polynomial g is fixed. Considering all the elements f of fixed degree, we establish asymptotically optimal b...
Gespeichert in:
| Veröffentlicht in: | Combinatorics, probability & computing Jg. 31; H. 1; S. 166 - 183 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
01.01.2022
|
| Schlagworte: | |
| ISSN: | 0963-5483, 1469-2163 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | We analyse the behaviour of the Euclidean algorithm applied to pairs (
g
,
f
) of univariate nonconstant polynomials over a finite field
$\mathbb{F}_{q}$
of
q
elements when the highest degree polynomial
g
is fixed. Considering all the elements
f
of fixed degree, we establish asymptotically optimal bounds in terms of
q
for the number of elements
f
that are relatively prime with
g
and for the average degree of
$\gcd(g,f)$
. We also exhibit asymptotically optimal bounds for the average-case complexity of the Euclidean algorithm applied to pairs (
g
,
f
) as above. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0963-5483 1469-2163 |
| DOI: | 10.1017/S0963548321000274 |