Subquadratic-time factoring of polynomials over finite fields (Q4396457)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1165749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subquadratic-time factoring of polynomials over finite fields |
scientific article; zbMATH DE number 1165749 |
Statements
Subquadratic-time factoring of polynomials over finite fields (English)
0 references
14 June 1998
0 references
factoring
0 references
univariate polynomials
0 references
finite fields
0 references
subquadratic complexity
0 references
baby step/giant step
0 references
probabilistic algorithms
0 references
0 references
0.8820658
0 references
0.8753186
0 references
0.8734764
0 references
0.8703758
0 references
0 references
0.86395353
0 references
