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/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

International audienceAs a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic $p$, there exists an algorithm that computes, for $\ell$ an Elkies prime, $\ell$-torsion points in an extension of degree $\ell-1$ at cost $\tilde{Ot}(\ell \, \max(\ell, \log q)^2)$ bit operations in the favorable case where $\ell\leqslant p/2$.We combine in this work a fast algorithm for computing isogenies due to Bostan, Morain, Salvy and Schost with the $p$-adic approach followed by Joux and Lercier to get an algorithm valid without any limitation on $\ell$ and $p$ but of similar complexity. For the sake of simplicity, we precisely state here the algorithm in the case of finite fields with characteristic $p\geqslant 5$. We give experiment results too

On Elkies subgroups of \ell -torsion points in elliptic curves defined over a finite field