{"paper":{"title":"On the linear complexity profile of some sequences derived from elliptic curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Arne Winterhof, L\\'aszl\\'o M\\'erai","submitted_at":"2015-09-23T10:17:22Z","abstract_excerpt":"For a given elliptic curve $\\mathbf{E}$ over a finite field of odd characteristic and a rational function $f$ on $\\mathbf{E}$ we first study the linear complexity profiles of the sequences $f(nG)$, $n=1,2,\\dots$ which complements earlier results of Hess and Shparlinski. We use Edwards coordinates to be able to deal with many $f$ where Hess and Shparlinski's result does not apply. Moreover, we study the linear complexities of the (generalized) elliptic curve power generators $f(e^nG)$, $n=1,2,\\dots$. We present large families of functions $f$ such that the linear complexity profiles of these se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06909","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}