Elliptic curve point counting over finite fields with Gaussian normal basis

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 294
  • Download : 0
In this paper, we present the GNB-aided MSST algorithm for the curves over finite fields that have a Gaussian normal basis of type t less than or equal to 2. It is based on the MSST algorithm proposed by P. Gaudry [3] at ASIACRYPT 2002. For those fields, we combine the lifting phase of the MSST algorithm and the norm computation algorithm in [6]. So the time complexity of the MSST is reduced from O(N2mu+0.5) to O(N2mu+1/(mu+1)) and it runs faster than any other algorithms in our case.
Publisher
Nippon Gakushiin/Japan Academy
Issue Date
2003-01
Language
English
Article Type
Article
Citation

PROCEEDINGS OF THE JAPAN ACADEMY SERIES A: MATHEMATICAL SCIENCES, v.79, no.1, pp.5 - 8

ISSN
0386-2194
URI
http://hdl.handle.net/10203/83650
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0