The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime (Q3714154)
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: The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime |
scientific article |
Statements
The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime (English)
0 references
1986
0 references
finite fields
0 references
multiplicative inverse
0 references
Mersenne prime
0 references
Euclid's algorithm
0 references
modified Euclidean algorithm
0 references
0.91444075
0 references
0.9055688
0 references
0.90377384
0 references
0.89498746
0 references
0.8821677
0 references
0.87439996
0 references
0.8734664
0 references
0.8720782
0 references
0.8687614
0 references
