2000 character limit reached
Linear complexity of some sequences derived from hyperelliptic curves of genus 2
Published 4 Feb 2021 in math.NT, cs.IT, and math.IT | (2102.02605v1)
Abstract: For a given hyperelliptic curve $C$ over a finite field with Jacobian $J_C$, we consider the hyperelliptic analogue of the congruential generator defined by $W_n=W_{n-1}+D$ for $n\geq 1$ and $D,W_0\in J_C$. We show that curves of genus 2 produce sequences with large linear complexity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
