Abstract
The bounds obtained in Chapter 12 are related to the arithmetic model of computation. Intuitively, the arithmetic model seems more powerful than the Boolean model (and in some situations it is), but there is no proof that this is really the case for our particular situation. Moreover, as a dual question of computing powers in parallel shows in some cases (over finite fields of small characteristic), the Boolean model of computation is exponentially more powerful than the arithmetic model [200, 201].
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Basel AG
About this chapter
Cite this chapter
Shparlinski, I. (2003). Boolean Complexity 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_14
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8037-4_14
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9415-9
Online ISBN: 978-3-0348-8037-4
eBook Packages: Springer Book Archive