English

On the elliptic curve endomorphism generator

Number Theory 2017-06-28 v1

Abstract

For an elliptic curve EE over a finite field we define the point sequence (Pn)(P_n) recursively by Pn=ϑ(Pn1)=ϑn(P0)P_n=\vartheta (P_{n-1})=\vartheta ^n(P_0) with an endomorphism ϑEnd(E)\vartheta \in\mathrm{End}(E) and with some initial point P0P_0 on EE. We study the distribution and the linear complexity of sequences obtained from (Pn)(P_n).

Keywords

Cite

@article{arxiv.1706.08710,
  title  = {On the elliptic curve endomorphism generator},
  author = {László Mérai},
  journal= {arXiv preprint arXiv:1706.08710},
  year   = {2017}
}
R2 v1 2026-06-22T20:30:40.058Z