Tate pairing computation on the divisors of hyperelliptic curves for cryptosystems.
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In recent papers [4], [9] they worked on hyperelliptic curves H b defined by y +y = x +x +b over a finite field F2 n with b = 0 or 1 for a secure and e#cient pairing-based cryptosystems. We find a completely general method for computing the Tate-pairings over divisor class groups of the curves H b in a very explicit way. In fact, Tate-pairing is defined over the entire divisor class group of a curve, not only over the points on a curve. So far only pointwise approach has been made in [4], [9] for the Tate-pairing computation on the hyperelliptic curves H b over F2 n . Furthermore, we obtain a very e#cient algorithm for the Tate pairing computation over divisors by reducing the cost of computing. We also find a necessary condition for hyperelliptic curve to have a significant reduction of the loop cost in the Tate pairing computation. Keywords- Tate pairing computation, hyperelliptic curve, cryptosystem, divisors 1
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.
Full frame distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it