Lower bounds on the linear complexity of the discrete logarithm in finite fields (Q4544724): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 17:20, 5 March 2024

scientific article; zbMATH DE number 1775982
Language Label Description Also known as
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
    0 references
    0 references
    0 references
    4 August 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    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