Lower bounds on the linear complexity of the discrete logarithm in finite fields (Q4544724)
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: Lower bounds on the linear complexity of the discrete logarithm in finite fields |
scientific article; zbMATH DE number 1775982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds on the linear complexity of the discrete logarithm in finite fields |
scientific article; zbMATH DE number 1775982 |
Statements
Lower bounds on the linear complexity of the discrete logarithm in finite fields (English)
0 references
4 August 2002
0 references
cyclotomic generator
0 references
finite fields
0 references
Mullen-White polynomial
0 references
linear complexity
0 references
residue class ring
0 references
discrete logarithm
0 references
0.8610497713088989
0 references
0.8610495328903198
0 references
0.8244904279708862
0 references
0.8089572191238403
0 references
