scientific article; zbMATH DE number 1303114

MaRDI QIDQ4249629zbMATH OpenFDO

Authors Ueli M. Maurer, S. Wolf

Publication date 6 September 1999

zbMATH Keywords

complexitycomputational problems in cyclic groupsDiffie-Hellman problemgeneric algorithmsgeneric reduction of the discrete logarithm problemlower boundsroots in finite groups

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Cryptography (94A60)

Recommendations

• On the complexity of the discrete logarithm and Diffie-Hellman problems
• scientific article; zbMATH DE number 1583798
• On the Equivalence of Generic Group Models
• On generic complexity of the discrete logarithm problem

Cited in

(28)

• The Discrete Logarithm problem with preprocessing
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Generic-group delay functions require hidden-order groups
• DLP in semigroups: algorithms and lower bounds
• Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
• The ``Quantum annoying property of password-authenticated key exchange protocols
• On instantiating the algebraic group model from falsifiable assumptions
• Cryptography and algorithmic randomness
• On the analysis of cryptographic assumptions in the generic ring model
• Homomorphic public-key cryptosystems and encrypting Boolean circuits
• Generic groups, collision resistance, and ECDSA
• Public-key cryptography and invariant theory
• On non-Abelian homomorphic public-key cryptosystems
• Correspondences on hyperelliptic curves and applications to the discrete logarithm
• Efficiency limitations for -protocols for group homomorphisms
• Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
• scientific article; zbMATH DE number 1104166 (Why is no real title available?)
• scientific article; zbMATH DE number 2086711 (Why is no real title available?)
• Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
• On generic complexity of the discrete logarithm problem
• Remarks on Cheon’s Algorithms for Pairing-Related Problems
• On the Equivalence of Generic Group Models
• On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
• LATIN 2004: Theoretical Informatics
• On time-lock cryptographic assumptions in abelian hidden-order groups
• Bounds in various generalized settings of the discrete logarithm problem
• Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
• Fine-grained non-interactive key exchange, revisited

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249629)