Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For a given elliptic curve $$\mathbf {E}$$E over a finite field of odd characteristic and a rational function f on $$\mathbf {E}$$E  first study the linear complexity profiles of the sequences f(nG), $$n=1,2,\dots $$n=1,2,ź which complements earlier results of Hess and Shparlinski.  use Edwards coordinates to be able to deal with many f where Hess and Shparlinski's result does not apply. Moreover,  study the linear complexities of the (generalized) elliptic curve por generators $$f(e^nG)$$f(enG), $$n=1,2,\dots $$n=1,2,ź  present large families of functions f such that the linear complexity profiles of these sequences are large.
['László Mérai', 'Arne Winterhof']
I am writing a research paper on a idea On the linear complexity profile of some sequences derived from elliptic curves
[{"from": "human", "value": "I am writing a research paper on a idea On the linear complexity profile of some sequences derived from elliptic curves"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For a given elliptic curve $$\\mathbf {E}$$E over a finite field of odd characteristic and a rational function f on $$\\mathbf {E}$$E  first study the linear complexity profiles of the sequences f(nG), $$n=1,2,\\dots $$n=1,2,\u017a which complements earlier results of Hess and Shparlinski.  use Edwards coordinates to be able to deal with many f where Hess and Shparlinski's result does not apply. Moreover,  study the linear complexities of the (generalized) elliptic curve por generators $$f(e^nG)$$f(enG), $$n=1,2,\\dots $$n=1,2,\u017a  present large families of functions f such that the linear complexity profiles of these sequences are large."}]