Research · Hardness of the discrete logarithm
Classifying Weil Descent Vulnerability
Only the scaffold-authorized Frobenius-span/genus fallback was completed for degrees 4, 6, and 8.
Problem
Formal statement
Given an elliptic curve and a genus bound , decide whether a curve of genus at most admits a cover to defined over , and construct the cover when it exists.
The initial experimental regime is characteristic two with and .
First target
CITED For an ordinary binary curve the classical GHS construction is controlled by the -span of the Frobenius conjugates of together with the constant (Gaudry–Hess–Smart, 2002, Journal of Cryptology, doi:10.1007/s00145-001-0011-x).
The first target is to compute that span exactly, reproduce a published genus, and exhaustively tabulate the resulting GHS genus for every nonzero for .
Scope
This session studies only the classical characteristic-two GHS locus. It does not decide the existence of arbitrary covers, analyze odd characteristic, or include isogeny walks.
Findings & state of play
Outcome: FAILED. Preserve the partial data, but do not treat this session as completion of SG-01 or of the requested deliverables.
State in five lines
- Basic binary GHS span/genus computation is implemented and validated.
- Every nonzero was swept at (333 rows total).
- The documented example reproduces genus 31.
- Low-genus - and -loci have explicit equations in
RESULTS.md. - No explicit cover map or end-to-end DLP has been built.
What is established
- CITED GHS magic number: Gaudry–Hess–Smart (2002).
- CITED Exact genus branch: Hess (2003).
- EMPIRICAL: all , Full census and Frobenius-invariance checks pass.
- EMPIRICAL: published Magma V2.19.8 example Rank 5, magic 6, genus 31.
- EMPIRICAL: all full-degree parameters, same range Minimum genera are 4, 8, 16.
What is ruled out
- Genus alone is not evidence of a faster attack; no subgroup-order or Jacobian-DLP cost was measured.
- The current code computes the GHS invariant but does not construct , , or the divisor map.
Active thread
A001 is dead as an implementation of SG-01: the Frobenius-span classification works, but it never constructs the required function field, curve, or map.
Next action
Derive the distribution from the Maurer–Menezes–Teske type-counting theorem, then select the , genus-3 subfield case for a hand-built cover-map experiment.
Invariants — do not violate
- Curves use with and .
- Sweeps set , so the GHS regularity trace condition holds.
- “Low genus” in the locus CSV means the declared experimental bound , not proven attackability.
- The 155-bit run is only the justified published-example regression; routine experiments stay below the 60-bit ceiling.
Files that matter
code/ghs.py: validated invariant implementation.code/verify_published_example.py: genus-31 regression.code/sweep_ghs_genus.py: deterministic census and summaries.data/sweep_ghs_genus_n4-6-8_20260623.csv: all 333 rows.data/ghs_genus_distribution_n4-6-8_20260623.csv: exact distribution.data/ghs_low_genus_locus_n4-6-8_20260623.csv: equations and densities.RESULTS.md: concise interpretation and limitations.
What I would tell my replacement
The useful object is the Frobenius annihilator, not just the rank. For the selected bounds, the union of low-rank classes is a single kernel, which makes the -locus equation immediate after inversion.