Welcome to the resource topic for 2009/086
Title:
Point Compression for Koblitz Elliptic Curves
Authors: P. N. J. Eagle, Steven D. Galbraith, John Ong
Abstract:Elliptic curves over finite fields have applications in public key cryptography. A Koblitz curve is an elliptic curve E over \F_2; the group E( \Ftn ) has convenient features for efficient implementation of elliptic curve cryptography. Wiener and Zuccherato and Gallant, Lambert and Vanstone showed that one can accelerate the Pollard rho algorithm for the discrete logarithm problem on Koblitz curves. This implies that when using Koblitz curves, one has a lower security per bit than when using general elliptic curves defined over the same field. Hence for a fixed security level, systems using Koblitz curves require slightly more bandwidth. We present a method to reduce this bandwidth when a normal basis representation for \Ftn is used. Our method is appropriate for applications such as Diffie-Hellman key exchange or Elgamal encryption. We show that, with a low probability of failure, our method gives the expected bandwidth for a given security level.
ePrint: https://eprint.iacr.org/2009/086
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .