arXiv:2102.02605 [math.NT]AbstractReferencesReviewsResources
Linear complexity of some sequences derived from hyperelliptic curves of genus 2
Vishnupriya Anupindi, László Mérai
Published 2021-02-04Version 1
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.
Comments: 19 pages
Related articles: Most relevant | Search more
Recursive towers of curves over finite fields using graph theory
Fast construction of irreducible polynomials over finite fields
The Riemann Hypothesis for Function Fields over a Finite Field