Counting hyperelliptic curves that admit a Koblitz model

From MaRDI portal
Publication:3537522

DOI10.1515/JMC.2008.008zbMATH Open1152.14021arXiv0705.1423MaRDI QIDQ3537522FDOQ3537522


Authors: Cevahir Demirkiran, Enric Nart Edit this on Wikidata


Publication date: 7 November 2008

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Abstract: Let k be a finite field of odd characteristic. We find a closed formula for the number of k-isomorphism classes of pointed, and non-pointed, hyperelliptic curves of genus g over k, admitting a Koblitz model. These numbers are expressed as a polynomial in the cardinality q of k, with integer coefficients (for pointed curves) and rational coefficients (for non-pointed curves). The coefficients depend on g and the set of divisors of q-1 and q+1. These formulas show that the number of hyperelliptic curves of genus g suitable (in principle) of cryptographic applications is asymptotically (1-e^{-1})2q^{2g-1}, and not 2q^{2g-1} as it was believed. The curves of genus g=2 and g=3 are more resistant to the attacks to the DLP; for these values of g the number of curves is respectively (91/72)q^3+O(q^2) and (3641/2880)q^5+O(q^4).


Full work available at URL: https://arxiv.org/abs/0705.1423




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Counting hyperelliptic curves that admit a Koblitz model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537522)