A short proof for explicit formulas for discrete logarithms in finite fields (Q802668): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A knapsack-type public key cryptosystem based on arithmetic in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete logarithms in \(\mathrm{GF}(p)\) / rank
 
Normal rank
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: Q3726006 / 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 16:39, 21 June 2024

scientific article
Language Label Description Also known as
English
A short proof for explicit formulas for discrete logarithms in finite fields
scientific article

    Statements

    A short proof for explicit formulas for discrete logarithms in finite fields (English)
    0 references
    0 references
    1990
    0 references
    The author gives a very elegant and short proof of two explicit formulas for discrete logarithms. The first one was found by Mullen and White and the second one by Wells. The formula of Wells is generalized.
    0 references
    0 references