Abstract
Here we show that polynomials and algebraic functions approximating the discrete logarithm modulo p on sufficiently large sets must be of sufficiently large degree, in fact exponentially large (in terms of logp). Many of the results of this chapter can also be found in [48]. We start with a rather simple statement.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Basel AG
About this chapter
Cite this chapter
Shparlinski, I. (1999). Approximation of the Discrete Logarithm Modulo p. In: Number Theoretic Methods in Cryptography. Progress in Computer Science and Applied Logic, vol 17. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8664-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8664-2_4
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9723-5
Online ISBN: 978-3-0348-8664-2
eBook Packages: Springer Book Archive