On the elliptic curve endomorphism generator
Abstract
For an elliptic curve E over a finite field we define the point sequence (Pn) recursively by Pn= (Pn-1)= n(P0) with an endomorphism ∈End(E) and with some initial point P0 on E. We study the distribution and the linear complexity of sequences obtained from (Pn).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.