Abstract
Let g be a primitive root of a finite field Fq of q elements.
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
Rights and permissions
Copyright information
© 1999 Springer Basel AG
About this chapter
Cite this chapter
Shparlinski, I. (1999). Polynomial Approximation and Arithmetic Complexity of the Diffie—Hellman Key. 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_8
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8664-2_8
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9723-5
Online ISBN: 978-3-0348-8664-2
eBook Packages: Springer Book Archive