Abstract
We begin with presenting two results from [222] about the bit security of the DiffieHellman secret key which generalise Theorem 2 of [64]. We have already mentioned that the proof of Theorem 2 of [64] is not quite correct and it applies only to some special inputs. Using the bounds of exponential sums, namely Lemmas 3.15 and 3.16, allows us to complete the proof and also extend the result to more general settings. Accordingly, the bound of Lemma 3.24 has been used in [523] to obtain somewhat stronger results, see also Theorem 14.3 below.
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). Bit Security of the Diffie—Hellman Secret Key. 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_15
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8037-4_15
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9415-9
Online ISBN: 978-3-0348-8037-4
eBook Packages: Springer Book Archive