Abstract
We have seen in the previous chapter that the security of a discrete logarithm based cryptosystem relies mainly on the order of the underlying group, unless special structures allow more efficient algorithms for breaking the system. If the group order is large enough, then square root attacks like Shanks’s baby-step giant-step or Pollard’s ρ-methods are not applicable. To make the Pohlig-Hellman attack impractical, two different approaches are conceivable.
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 Science+Business Media New York
About this chapter
Cite this chapter
Enge, A. (1999). Counting Points on Elliptic Curves. In: Elliptic Curves and Their Applications to Cryptography. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5207-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5207-9_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7372-8
Online ISBN: 978-1-4615-5207-9
eBook Packages: Springer Book Archive