Back to Search
Start Over
Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves.
- Source :
- Applicable Algebra in Engineering, Communication & Computing; Feb2005, Vol. 15 Issue 5, p329-337, 19p
- Publication Year :
- 2005
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- ALGEBRAIC curves
DATA encryption
ALGORITHMS
CRYPTOGRAPHY
Subjects
Details
- Language :
- English
- ISSN :
- 09381279
- Volume :
- 15
- Issue :
- 5
- Database :
- Complementary Index
- Journal :
- Applicable Algebra in Engineering, Communication & Computing
- Publication Type :
- Academic Journal
- Accession number :
- 18421430