Abstract
In this chapter we consider various approximations and representations of the discrete logarithm modulo a divisordofp —1. Certainly the case ofd =2 is of special interest because it corresponds to the representation of the rightmost bit of ind x.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Basel AG
About this chapter
Cite this chapter
Shparlinski, I. (2003). Approximation of the Discrete Logarithm Modulo p — 1 . In: Shparlinski, I. (eds) Cryptographic Applications of Analytic Number Theory. Progress in Computer Science and Applied Logic, vol 22. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8037-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8037-4_10
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9415-9
Online ISBN: 978-3-0348-8037-4
eBook Packages: Springer Book Archive