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

DOI10.1016/S0020-0190(99)00047-2zbMath1003.94521OpenAlexW2085772322WikidataQ29544284 ScholiaQ29544284MaRDI QIDQ1606932

Dan Boneh, Omer Reingold, Eli Biham

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00047-2

zbMATH Keywords

factorization algorithmBlum integersgeneralized Diffie-Hellman assumption

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (9)

Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory ⋮ Efficient selective identity-based encryption without random oracles ⋮ The RSA group is pseudo-free ⋮ A Digital Signature Scheme Based on Two Hard Problems ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Oblivious signature-based envelope ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ Synthesizers and their application to the parallel construction of pseudo-random functions

This page was built for publication: Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring