MétaCan
Menu
Back to cohort
Record W2144706139 · doi:10.1109/isit.2004.1365583

On the zeta functions of two towers of function fields

2004· article· en· W2144706139 on OpenAlexaff
Kenneth W. Shum, Ian F. Blake, V. Kumar Murty

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsJacobian matrix and determinantHyperelliptic curve cryptographyDiscrete logarithmMathematicsFinite fieldAbelian groupRiemann zeta functionElliptic curveHyperelliptic curvePure mathematicsFunction (biology)Elliptic functionLogarithmDiscrete mathematicsApplied mathematicsMathematical analysisElliptic curve cryptographyComputer sciencePublic-key cryptography

Abstract

fetched live from OpenAlex

The discrete logarithm problem (DLP) on elliptic curves over finite field has been extensively studied as a cryptographic building block. The DLP recently was considered over other algebraic structures such as Jacobian of hyperelliptic curves, superelliptic curves, and Abelian varieties in general. The main objective is to determine a large subgroup of prime order for which no index calculus attack is known. We investigate the Jacobian of two towers of function fields that have good asymptotic property as another potential source of Abelian groups for the DLP. This paper is the first step in this direction and compute the size of the Jacobian via the zeta function.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.879
Threshold uncertainty score0.151

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.015
GPT teacher head0.223
Teacher spread0.208 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicCoding theory and cryptographyFrench-language works237,207