A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex> (Q3691838)

From MaRDI portal
Revision as of 22:47, 17 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
scientific article

    Statements

    A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex> (English)
    0 references
    0 references
    1985
    0 references
    cryptography
    0 references
    subexponential algorithm
    0 references
    finite field
    0 references
    probabilistic algorithm
    0 references
    logarithms
    0 references
    quadratic field
    0 references
    complexity analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references