A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2) (Q5019338): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5565227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factorisation, with a suggested new approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Fast Factorization of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of quadratic residues modulo a prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank

Latest revision as of 16:09, 27 July 2024

scientific article; zbMATH DE number 7454006
Language Label Description Also known as
English
A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2)
scientific article; zbMATH DE number 7454006

    Statements

    A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2) (English)
    0 references
    0 references
    8 January 2022
    0 references
    discrete logarithm
    0 references
    real field
    0 references
    discrete logarithm problem
    0 references
    quadratic field
    0 references
    quadratic residue
    0 references

    Identifiers