A note on discrete logarithms in finite fields (Q1196517): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3216750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial representation for logarithms in GF(q) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof for explicit formulas for discrete logarithms in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fast Fourier Transform in a Finite Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial form for logarithms modulo a prime (Corresp.) / rank
 
Normal rank

Latest revision as of 13:51, 16 May 2024

scientific article
Language Label Description Also known as
English
A note on discrete logarithms in finite fields
scientific article

    Statements

    A note on discrete logarithms in finite fields (English)
    0 references
    0 references
    0 references
    14 December 1992
    0 references
    Let \(F_ q\) denote the finite field of order \(q\), \(q=p^ n\geq 3\), \(p\) prime and \(F^*_ q\) the cyclic multiplicative group of nonzero elements. If \(\alpha\in F^*_ q\) is primiitve, the discrete logarithm of \(\beta\in F^*_ q\) to base \(\alpha\) is the unique integer \(x\) such that \(\beta=\alpha^ x\). It was previously shown that for \(q=p\) a prime \[ \log_ \alpha\beta=\sum^{p-2}_{i=1}(1-\alpha^ i)^{-1}\beta^ i. \] This note generalizes this formula to cases where the base is not necessarily a primitive element and to prime power fields.
    0 references
    cryptography
    0 references
    finite field
    0 references
    discrete logarithm
    0 references
    0 references

    Identifiers