Linear Complexity of Sequences on Koblitz Curves of Genus 2
Vishnupriya Anupindi
TL;DR
This paper demonstrates that the hyperelliptic Frobenius endomorphism generator produces sequences with high linear complexity on genus 2 curve Jacobians, contributing to cryptographic sequence generation.
Contribution
It introduces a hyperelliptic analogue of the Frobenius endomorphism generator for genus 2 curves and analyzes its linear complexity.
Findings
Sequences have large linear complexity on genus 2 Jacobians
The hyperelliptic Frobenius generator is effective for cryptographic sequences
Supports the security of sequences based on genus 2 curves
Abstract
In this paper, we consider the hyperelliptic analogue of the Frobenius endomorphism generator and show that it produces sequences with large linear complexity on the Jacobian of genus 2 curves.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Algebraic Geometry and Number Theory · Advanced Algebra and Geometry