Improvements in the computation of the Hasse-Witt matrix
スポンサーリンク
概要
- 論文の詳細を見る
The Hasse-Witt matrix of a hyperelliptic curve gives partial information for the order of the Jacobian of the curve, therefore the Hasse-Witt matrices can be used for point counting of hyperelliptic curves. Bostan, Gaudry and Schost improved the Chudnovsky-Chudnovsky algorithm and computed the Hasse-Witt matrices by using their improved algorithm for constructing hyperelliptic cryptosystems. The both algorithms need $p$-adic integers with finite precision as the base operations. This paper shows improvements in the computation of the Hasse-Witt matrix that reduces the required precision of the $p$-adic integers.
- The Japan Society for Industrial and Applied Mathematicsの論文
The Japan Society for Industrial and Applied Mathematics | 論文
- Computational and Symbolic Anonymity in an Unbounded Network
- Finite element computation for scattering problems of micro-hologram using DtN map
- A new compressible fluid model for traffic flow with density-dependent reaction time of drivers
- A new method for fast computation of cumulative distribution functions by fractional FFT
- Evolution of bivariate copulas in discrete processes