Koblitz curves have been proposed to quickly generate random ideal classes and points on hyperelliptic and elliptic curves. To obtain a further speed-up a different way of generating these random elements has recently been proposed. In this paper we give an upper bound on the number of collisions for this alternative approach. For elliptic Koblitz curves we additionally use the same methods to derive a bound for a modified algorithm. These bounds are tight for cyclic subgroups of prime order, which is the case of most practical interest for cryptography.
Journal of Applicable Algebra in Engineering, 2005, Vol 15, Issue 5, p. 329-337
Public key cryptography; discrete logarithm; hyperelliptic curves; Koblitz curves; collisions