Lower Bounds for Discrete Logarithms and Related Problems

@inproceedings{Shoup1997LowerBF,
  title={Lower Bounds for Discrete Logarithms and Related Problems},
  author={Victor Shoup},
  booktitle={EUROCRYPT},
  year={1997}
}
This paper considers the computational complexity of the discrete logarithm and related problems in the context of "generic algorithms"--that is, algorithms which do not exploit any special properties of the encodings of group elements, other than the property that each group element is encoded as a unique binary string. Lower bounds on the complexity of these problems are proved that match the known upper bounds: any generic algorithm must perform Ω(p1/2) group operations, where p is the… CONTINUE READING
BETA

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 701 CITATIONS

Final Report on Verification and Assessment

VIEW 5 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

On the Security of the SPEKE Password-Authenticated Key Exchange Protocol

  • IACR Cryptology ePrint Archive
  • 2001
VIEW 9 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing

  • IACR Cryptology ePrint Archive
  • 2018
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Automated Analysis of Cryptographic Assumptions in Generic Group Models

  • Journal of Cryptology
  • 2018
VIEW 9 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

The Discrete-Logarithm Problem with Preprocessing

  • IACR Cryptology ePrint Archive
  • 2017
VIEW 17 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Baby-Step Giant-Step Algorithms for the Symmetric Group

VIEW 4 EXCERPTS
CITES RESULTS & BACKGROUND
HIGHLY INFLUENCED

Unconditionally Anonymous Ring and Mesh Signatures

  • Journal of Cryptology
  • 2015
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1996
2019

CITATION STATISTICS

  • 89 Highly Influenced Citations

  • Averaged 38 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

Di  eHellman oracles

I. V.
  • Advances in Cryptology { Crypto '
  • 1996

Nechaev . Complexity of a determinate algorithm for the discrete logarithm

S. Pohlig, M.
  • Mathematical Notes
  • 1994

Towards the equivalence of breaking the Di  eHellman protocol andcomputing discrete logarithms

S. Wolf.
  • Advances in Cryptology { Crypto '
  • 1994

On the complexity of matrix group problems I

R. J. Lipton.
  • 1984

Hellman . An improved algorithm for computing logarithms overGF ( p ) and its cryptographic signi cance

J. M. Pollard
  • IEEE Trans . Inf . Theory
  • 1978

Algorithms for black - box elds and their applicationto cryptography

L. A. Levin.
  • Advances in Cryptology { Crypto '

Similar Papers

Loading similar papers…