English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

In this work, we investigate hyperelliptic curves of type $C: y^2 = x^{2g+1}+ ax^{g+1} + bx$ over the finite field $\mathbb{F}_q, q = p^n, p > 2$. For thecase of $g = 3$ and $4$ we propose algorithms to compute the number of pointson the Jacobian of the curve with complexity $\tilde{O}(\log^4{p})$ and$\tilde{O}(\log^8{p})$. For curves of genus $2-7$ we give a complete list ofthe characteristic polynomials of Frobenius endomorphism modulo $p$.

Counting points on hyperelliptic curves of type $y^2=x^{2g+1} + ax^{g+1} + bx$