Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm (Q2878836)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm |
scientific article; zbMATH DE number 6340495
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm |
scientific article; zbMATH DE number 6340495 |
Statements
5 September 2014
0 references
successive resultants algorithm
0 references
polynomial equations
0 references
elliptic curve discrete logarithm problem
0 references
0 references
0 references
0.8797011
0 references
0.87402356
0 references
0 references
0.86967075
0 references
0.86622316
0 references
0.8645932
0 references
Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm (English)
0 references
