Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring (Q1606932)

From MaRDI portal
Revision as of 10:32, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
scientific article

    Statements

    Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring (English)
    0 references
    0 references
    0 references
    0 references
    25 July 2002
    0 references
    generalized Diffie-Hellman assumption
    0 references
    factorization algorithm
    0 references
    Blum integers
    0 references

    Identifiers