Elliptic curve traits and their security connections

A curve’s properties answer different questions. Some constrain discrete-logarithm security, some describe endomorphisms and isogenies, and others expose implementation or generation choices. This guide connects them without collapsing them into a single score.

Coverage
22 published DiSSECT traits plus eight foundational quantities
Scope
Educational interpretation, not a completed security evaluation
Example
Recomputed from a small curve by the site build

Scope and coverage

DiSSECT's AFRICACRYPT 2022 paper reports 22 traits, all listed in Appendix A. Sedláček's thesis, Appendix F.1, contains the same 22 entries with nonconsecutive labels such as a01, a12, a29 and i15. A high label does not imply that every intervening number is an entry.

This guide covers all 22 published entries plus eight explicitly added foundations, giving 30 numbered items. The additions make trace, j-invariant, field size, subgroup size, cofactor and endomorphisms explicit rather than burying them inside other traits. These are 30 study topics, not 30 independent measures of security or a claim that DiSSECT published 30 tests.

For each topic, separate mathematical structure, a demonstrated security mechanism, implementation dependence, and an unexplained statistical observation. An unusual curve is not thereby a weak curve.

How the quantities connect

Let E be an elliptic curve over F_q, q=p^m. Write N=#E(F_q), r=ord(G) for a chosen prime-order generator, and h=N/r. Reserve ell for a small auxiliary prime and s for an extension degree.

The central equations are

t = q + 1 - N,                  |t| <= 2 sqrt(q)
N_twist = q + 1 + t             (quadratic twist, ordinary setting here)
pi^2 - [t]pi + [q] = 0
D_pi = t^2 - 4q = v^2 d_K      (ordinary curves)
Z[pi] ⊆ End(E) ⊆ O_K
disc(End(E)) = f^2 d_K,         f divides v.

Here pi is q-power Frobenius, d_K is a fundamental imaginary quadratic discriminant, v is the conductor of Z[pi], and f is the conductor of the actual endomorphism ring. v and f need not agree.

For y²=x³+ax+b in characteristic greater than 3,

Delta_E = -16(4a³+27b²),
j = 1728(4a³)/(4a³+27b²).

Delta_E is a field element checking nonsingularity; D_pi is an integer describing Frobenius. They are different discriminants.

Explore all 30 topics

30 of 30 topics

1. Field q=p^m and representation Foundation

What it measures. Specifies coordinate arithmetic. Characteristic, extension degree, subfields and basis affect arithmetic and which mathematical reductions apply. Bit length alone does not establish security.

Security connection and study task. Record p, m, field polynomial/basis, and the smallest field over which the equation is defined. Contrast prime fields with binary extension fields.

Link to topic 1
2. Group order N and its factorization Foundation

What it measures. Counts rational points. Pohlig–Hellman separates a cyclic DLP according to prime-power factors of the actual point order. A smooth order is unsuitable even when q is large.

Security connection and study task. Verify N, retain prime factors with exponents, and identify what is proven versus still unfactored. Distinguish N from ord(G).

Link to topic 2
3. Selected subgroup order r Foundation

What it measures. Prime r sets the generic classical square-root work scale: roughly sqrt(r) group operations, before constants and usable symmetries.

Security connection and study task. Check r is prime, G is nonzero and [r]G=O. Explain why approximately 256-bit r corresponds to roughly 128-bit generic work.

Link to topic 3
4. Cofactor h=N/r Foundation

What it measures. Measures the group outside the selected subgroup. A nontrivial h creates protocol obligations, not an automatic failure of the r-subgroup.

Security connection and study task. State the protocol's subgroup validation or cofactor handling rules. Verify N=hr.

Link to topic 4
5. Frobenius trace t Foundation

What it measures. Connects point count, twist, isogeny class and endomorphism algebra. Over F_p, t=1 means N=p, the anomalous case. Ordinarity is equivalent to p not dividing t.

Security connection and study task. Derive N and twist order from t. Label the exact exceptional cases rather than assigning a continuous “weakness score” to t.

Link to topic 5
6. j-invariant Foundation

What it measures. Classifies curves up to isomorphism over an algebraic closure. Equal j does not imply isomorphism over the base field; twists are the key example. In characteristic >3, j=0 and 1728 have extra geometric automorphisms.

Security connection and study task. Compare a curve and its twist: same j, usually different orders. Check which automorphisms are actually defined over the working field.

Link to topic 6
7. Equation discriminant Delta_E Foundation

What it measures. Nonzero means the equation is nonsingular. Delta_E=0 gives a singular cubic, outside elliptic-curve group assumptions. Its numerical size or integer factorization is not an ECDLP hardness score.

Security connection and study task. Verify nonzero in the field. Change to an isomorphic equation and see why a raw integer lift is representation dependent.

Link to topic 7
8. Actual endomorphism ring, conductor f and usable maps Foundation

What it measures. The ordinary endomorphism ring is an order in K. An efficiently evaluable map can help legitimate scalar multiplication; suitable symmetries can also reduce generic search constants. Ring existence does not establish map efficiency.

Security connection and study task. Keep d_K, v, f and explicit maps in separate fields. Record map field of definition, degree, subgroup action and evaluation cost.

Link to topic 8
9. cofactor / a01 DiSSECT

What it measures. Group invariant factors over F_(q^s).

Security connection and study task. Write the group as Z/n1 × Z/n2 with n1 dividing n2. Unlike item 4, this describes the whole group, not just one quotient N/r. Check n1*n2=N_s and n1 divides q^s-1.

Link to topic 9
10. discriminant / a02 DiSSECT

What it measures. Integer D_pi and its square/fundamental decomposition.

Security connection and study task. Factor D_pi to separate v from d_K. This exposes CM structure; it does not factor a secret scalar. Do not infer the actual ring conductor f from v alone.

Link to topic 10
11. twist order / a03 DiSSECT

What it measures. Quadratic-twist cardinality and prime factors.

Security connection and study task. Relevant when an implementation can process twist points, especially x-only arithmetic. Compare r with the twist's largest prime subgroup and review the protocol's accepted inputs. Full point validation changes the relevance.

Link to topic 11
12. kn fact. / a04 DiSSECT

What it measures. Factors of kN-1 and kN+1.

Security connection and study task. Treat these as structural observations. For auxiliary-input DLP results, distinguish the subgroup r from N and require the precise additional-input assumptions; smooth r±1 alone does not break ordinary ECDH.

Link to topic 12
13. torsion extension / a05 DiSSECT

What it measures. Fields containing some/all ell-torsion.

Security connection and study task. For ell≠p, compare one nonzero torsion point with full E[ell]. The identity is always rational, so “some torsion” must exclude it. Relate extension degrees to Frobenius acting on a two-dimensional vector space.

Link to topic 13
14. conductor / a06 DiSSECT

What it measures. Discriminant growth after base extension.

Security connection and study task. Compute D_s/D_1 and separate this trait from f in item 8. It tracks changes in the Frobenius order and rational isogeny structure. Extending the field does not itself change the geometric endomorphism ring.

Link to topic 14
15. embedding / a07 DiSSECT

What it measures. Multiplicative order of q modulo r, presented through its complement.

Security connection and study task. Record the actual k=ord_r(q), not just (r-1)/k. Pairing transfer places the DLP in F_(q^k)*; security depends on that finite-field DLP as well as the source group. A universal cutoff on k is insufficient.

Link to topic 15
16. class number / a08 DiSSECT

What it measures. Bounds for the imaginary quadratic field class number.

Security connection and study task. Explain ideal classes and their relation to CM/isogenies. Distinguish h(d_K) from h(f²d_K), and both from subgroup cofactor h. Preserve lower/upper bounds rather than reporting them as exact values.

Link to topic 16
17. small prime order / a12 DiSSECT

What it measures. Multiplicative order of a small ell modulo N.

Security connection and study task. This is an order in (Z/NZ)*, not the order of a curve point. It is defined only when gcd(ell,N)=1. Relate it to scalar arithmetic; do not identify it with embedding degree unless the base is q.

Link to topic 17
18. division pol. / a22 DiSSECT

What it measures. Factorization of an ell-division polynomial.

Security connection and study task. Polynomial factors encode Frobenius orbits of torsion x-coordinates. Compare factor degrees with item 13. Recovering x does not necessarily recover y over the same field; retain the sign distinction.

Link to topic 18
19. volcano / a23 DiSSECT

What it measures. Local ell-isogeny graph structure.

Security connection and study task. Relate its levels to ell-adic conductor valuations and splitting in K. Distinguish total volcano depth from the starting curve's level. A readily navigable local graph does not by itself solve a prime-subgroup DLP.

Link to topic 19
20. isogeny extension / a24 DiSSECT

What it measures. Fields where some/all degree-ell isogenies are rational.

Security connection and study task. A rational isogeny needs a Frobenius-stable kernel, not individually rational kernel points. Compare stable lines in E[ell] with fixed vectors: this explains why items 13 and 20 differ.

Link to topic 20
21. trace fact. / a25 DiSSECT

What it measures. Prime factors of extension traces t_s.

Security connection and study task. Factor signed traces and record zero separately. Smoothness of t_s does not imply smoothness of N_s. Use t_0=2, t_1=t, t_s=t*t_(s-1)-q*t_(s-2) to connect extensions.

Link to topic 21
22. isogeny neighbors / a28 DiSSECT

What it measures. Roots of a specialized modular polynomial.

Security connection and study task. Study adjacent j-invariants and compare with items 19–20. Distinct roots, repeated roots, rational kernels and distinct isogenies are not interchangeable counts, especially at special j.

Link to topic 22
23. q torsion / a29 DiSSECT

What it measures. Torsion over Q of a chosen coefficient lift.

Security connection and study task. Lifting residues a,b to integers chooses a new curve over Q. This is not a canonical inverse to reduction. Compare different lifts; finite-field ECDLP hardness does not follow from rational torsion size.

Link to topic 23
24. hamming x / i04 DiSSECT

What it measures. Counts at specified coordinate Hamming weights.

Security connection and study task. This depends on coordinate representation. Compare equivalent encodings or field bases. A biased point selector or implementation may care about the distribution; the distribution alone is not evidence of key leakage.

Link to topic 24
25. square 4p-1 / i06 DiSSECT

What it measures. Squarefree kernels of 4p-1 and 4r-1.

Security connection and study task. Record this as an exploratory arithmetic signature. It is neither N's factorization nor generally the curve's CM discriminant. Explain which integer the paper calls n here: the generator order.

Link to topic 25
26. pow distance / i07 DiSSECT

What it measures. Order proximity to binary/word boundaries.

Security connection and study task. Investigate uniform scalar generation and integer representation. Modular reduction of random bits can bias scalars; variable-length processing can leak through an implementation. Neither effect follows solely from proximity to a power of two.

Link to topic 26
27. multiples x / i08 DiSSECT

What it measures. x-coordinate of the scalar-divided generator.

Security connection and study task. Interpret G/k as [k^(-1) mod r]G when gcd(k,r)=1. A short coordinate may reveal how G was chosen; it does not reveal an unknown private scalar. Keep generator-specific traits separate from curve invariants.

Link to topic 27
28. x962 inv. / i13 DiSSECT

What it measures. a³/b² in the base field.

Security connection and study task. Use it to understand seed-to-coefficient generation. Where defined, j=1728(4u)/(4u+27) for u=a³/b². Thus u and j are algebraically dependent, not independent security signals. Handle b=0 separately.

Link to topic 28
29. brainpool overlap / i14 DiSSECT

What it measures. Coefficient bit overlap statistic.

Security connection and study task. Study generation-induced correlations and compare to the specified generation process. A predictable overlap can be expected behavior. It is not a secret-key relation. State bit ordering and the coefficient representation.

Link to topic 29
30. weierstrass / i15 DiSSECT

What it measures. Equation coefficients a,b.

Security connection and study task. Small coefficients can simplify arithmetic or reflect deliberate generation. Apply an isomorphism to separate coordinate appearance from curve structure. Small a or b is not a stand-alone weakness.

Link to topic 30

What factorization tells us

Object being factoredWhat its factors tell usSecurity conclusion permitted
N and ord(G)Decomposition into prime-power componentsDirectly relevant to Pohlig–Hellman. Use ord(G), not an unrelated group order, for the target problem.
N_twistAvailable twist subgroup sizesProtocol-dependent exposure if twist points are accepted.
r-1 and r+1Divisors relevant to multiplicative orders and certain auxiliary-input settingsCheck the exact protocol assumptions; not an unconditional improvement for an ordinary public-key DLP.
t_sDivisibility patterns of Frobenius tracesUseful for structure and recurrence checks; no monotone “smoother means weaker” rule.
D_pi=v²d_KFundamental field discriminant and nonmaximality of Z[pi]Endomorphism/isogeny information. Factorization does not establish an efficient extra map or its security effect.
D_s/D_1Changes in the Frobenius order under extensionStructural information, not a private-key factorization.
psi_ell(x) over F_qDegrees of irreducible polynomial factorsFields of torsion coordinates and Frobenius orbits. This is polynomial factorization, not integer factorization.
Integer lifts of j, Delta_E, a or bProperties of selected representativesGenerally not intrinsic hardness information.

The basic integer-versus-group distinction matters: a curve point is not an integer with a unique prime factorization. In elliptic-curve index calculus, expressing a point as a sum of factor-base points is a separate decomposition problem. Smoothness of D_pi or t does not establish an easy point decomposition.

A computed example

For y² = x³ + 2x + 3 over F_101, the build enumerates every coordinate pair and adds the identity. It also counts a quadratic twist independently.

N = 96 = 2^5 × 3
t = 6
N_twist = 108 = 2² × 3³
D_pi = -368 = 4² × (−23)
d_K = −23, v = 4
Delta_E = 44 mod 101
j = 74 mod 101

The group order is smooth. The discriminant decomposition describes the CM field and the Frobenius order; it does not establish the actual endomorphism-ring conductor. Here f divides 4, but further information is required to determine f. A nonzero equation discriminant establishes nonsingularity, not cryptographic security.

A six-phase study plan

Phase 1 — Build one trustworthy curve record

Cover items 1–7, 9, 11 and 15 first. Start with the worked example and several other tiny curves. Then use published parameters for representative prime-field curves as descriptive examples.

Deliverable: one page per curve with field, equation, generator, exact order relations, factorization status, trace, twist, j, nonsingularity and embedding-degree status. Each entry includes an explanation in words and one equation linking it to another entry.

Completion criteria: all point-count, subgroup and discriminant identities agree; incomplete factorization is visibly incomplete; every security claim names the mathematical or protocol assumption it needs.

Phase 2 — Connect Frobenius, CM and isogenies

Cover 8, 10, 13–14, 16 and 18–22. Use a tiny ordinary curve so torsion fields and local isogeny graphs can be inspected exactly.

Deliverable: a diagram with Frobenius at the center, branches to point count and twist, to the CM field and orders, and to torsion/isogeny field extensions. Accompany it with a small graph distinguishing volcano depth from a curve's position.

Completion criteria: explain v versus f, field versus order class number, point versus kernel rationality, and polynomial factor degree versus full torsion-point field degree without conflating them.

Phase 3 — Explain generation and representation

Cover 17 and 23–30. Compare a curve with an isomorphic equation, another generator of the same subgroup, its quadratic twist and different integer lifts of its coefficients.

Deliverable: a table identifying which traits survive each change. Add a coefficient-generation diagram for X9.62 and Brainpool.

Completion criteria: distinguish a curve invariant, an isogeny invariant, a generator property, a coordinate property and a generation fingerprint. Do not label intended generation structure a weakness.

Phase 4 — Audit the factorization claims

Revisit 2, 10–12, 14–18, 21 and 25. Construct a concept worksheet with one row per factorization object from the preceding table.

Deliverable: an evidence ledger with the exact integer or polynomial, factors and exponents, remaining cofactor, proof/primality status, field, source and interpretation. For protocol-conditional results, list the additional information required.

Completion criteria: explain why smooth N is different from smooth t, why r±1 requires special care, and why easy polynomial factorization does not itself solve a prime-order DLP.

Phase 5 — Compare distributions responsibly

Use the complete 30-item record for descriptive comparison of public curve parameters. Match field sizes, curve families, subgroup conditions, generation rules and representation. Avoid treating t, N, D_pi and their deterministic transforms as independent observations.

Deliverable: a source-linked comparison report with separate conclusions for established mathematical constraints, implementation questions, expected generation effects and unexplained statistical deviations.

Completion criteria: predeclare comparisons, account for multiple testing, preserve missing values, and confirm unusual observations on independent samples. An outlier alone supports an investigation, not a reduced security-bit claim.

Phase 6 — Bridge to binary and Koblitz curves

The short-Weierstrass formulas above and the original inventory's ordinary prime-field assumptions cannot simply be copied into characteristic two. Use the correct binary equation and invariants. Mark X9.62/Brainpool-specific tests inapplicable where appropriate.

For a curve defined over F_2 and studied over F_(2^m), separate the 2-power Frobenius sigma from q-power Frobenius pi=sigma^m. On F_(2^m)-rational points, pi is the identity; sigma can act nontrivially because the equation descends to F_2. This distinction explains why the smaller-field Frobenius supplies useful symmetry.

Deliverable: a separate binary-field adapter specification with minimal definition field, trace recurrence, subgroup structure, basis, Frobenius orbit lengths, map field of definition and applicable trait labels. Keep m=83 as the intended high-fidelity descriptive comparison point for the existing research, while making clear that no such evaluation was executed here.

Completion criteria: every formula states its characteristic and ordinarity assumptions. No representation reduction is reported as a measured improvement in relation collection or ECDLP security.

Evidence to retain

For each curve and trait retain: stable trait ID; source/version; applicability; raw value; normalized display value; defining field and representation; dependencies; exact/bounded/heuristic status; factorization completeness; verification method; mathematical interpretation; protocol assumptions; evidence URL; and whether any security consequence is established or merely a hypothesis.

Do not combine all 30 into a weighted “security score.” Use a structured report. Several traits are deterministic transforms of one another, some are representation dependent, and many have no established monotone connection to DLP hardness.

Primary sources

  1. Sedláček et al., DiSSECT, AFRICACRYPT 2022, Appendix A
  2. Vladimír Sedláček, On cryptographic weaknesses related to elliptic curves, Appendix F.1
  3. Andrew Sutherland, MIT 18.783, elliptic curve lecture notes
  4. Lochter and Merkle, RFC 5639, Brainpool curves and generation