scientific article; zbMATH DE number 1303114

zbMATH Open0919.94027MaRDI QIDQ4249629FDOQ4249629

Authors: Ueli M. Maurer, S. Wolf 

Publication date: 6 September 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

complexitylower boundsDiffie-Hellman problemgeneric algorithmscomputational problems in cyclic groupsgeneric reduction of the discrete logarithm problemroots in finite groups

Mathematics Subject Classification ID

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

Cited In (28)

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

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)