Skip to main content Accessibility help
×
Home

A HYPERELLIPTIC SMOOTHNESS TEST, II

  • H. W. LENSTRA (a1), J. PILA (a2) and CARL POMERANCE (a3)

Abstract

This series of papers presents and rigorously analyzes a probabilistic algorithm for finding small prime factors of an integer. The algorithm uses the Jacobian varieties of curves of genus 2 in the same way that the elliptic curve method uses elliptic curves. This second paper in the series is concerned with the order of the group of rational points on the Jacobian of a curve of genus 2 defined over a finite field. We prove a result on the distribution of these orders.

2000 Mathematical Subject Classification: 11Y05, 11G10, 11M20, 11N25.

Copyright

Keywords

A HYPERELLIPTIC SMOOTHNESS TEST, II

  • H. W. LENSTRA (a1), J. PILA (a2) and CARL POMERANCE (a3)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed