Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.19268 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- This paper examines the arithmetic of the loci \(\cL_n\), parameterizing genus 2 curves with \((n, n)\)-split Jacobians over finite fields \(\F_q\). We compute rational points \(|\cL_n(\F_q)|\) over \(\F_3\), \(\F_9\), \(\F_{27}\), \(\F_{81}\), and \(\F_5\), \(\F_{25}\), \(\F_{125}\), derive zeta functions \(Z(\cL_n, t)\) for \(n = 2, 3\). Utilizing these findings, we explore isogeny-based cryptography, introducing an efficient detection method for split Jacobians via explicit equations, enhanced by endomorphism ring analysis and machine learning optimizations. This advances curve selection, security analysis, and protocol design in post-quantum genus 2 systems, addressing efficiency and vulnerabilities across characteristics.