Efficient polynomial time algorithms computing industrial-strength primitive roots (Q1045890)
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: Efficient polynomial time algorithms computing industrial-strength primitive roots |
scientific article; zbMATH DE number 5650169
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient polynomial time algorithms computing industrial-strength primitive roots |
scientific article; zbMATH DE number 5650169 |
Statements
Efficient polynomial time algorithms computing industrial-strength primitive roots (English)
0 references
18 December 2009
0 references
computational complexity
0 references
cryptography
0 references
randomized algorithms
0 references
