{"id":"W3028759481","doi":"","title":"Faster Explicit Formulas for Computing Pairings over Ordinary Curves.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponentiation; Parameterized complexity; Pairing; Elliptic curve; Computer science; Computation; Cryptography; Context (archaeology); Quadratic equation; Arithmetic; Mathematics; Theoretical computer science; Algebra over a field; Algorithm; Pure mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002003822,0.001271886,0.001156834,0.001689066,0.001052028,0.003606275,0.002020446,0.001063276,0.02174162],"category_scores_gemma":[0.01335482,0.000639408,0.0009345676,0.002487781,0.001109907,0.010646,0.003776289,0.002965635,0.005266373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001223709,"about_ca_system_score_gemma":0.001250335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000831934,"about_ca_topic_score_gemma":0.002347889,"domain_scores_codex":[0.9982057,0.0003834506,0.0001539435,0.0002229432,0.0007675783,0.0002664131],"domain_scores_gemma":[0.9960437,0.001869065,0.0001789373,0.001238731,0.0005320986,0.0001374853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004522854,0.0002058808,0.001290837,0.0004591709,0.00006046844,0.0002338768,0.0004446513,0.01205205,0.004811877,0.6672038,0.01884512,0.29394],"study_design_scores_gemma":[0.0001141597,0.00009245335,0.0002858743,0.0001245657,0.00005217013,0.0002649883,0.0001316154,0.04521618,0.006118039,0.9270809,0.02047927,0.00003970492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05488451,0.002549491,0.8952442,0.001023137,0.0006440642,0.0001423888,0.0006891935,0.00430359,0.04051932],"genre_scores_gemma":[0.5332921,0.001600771,0.4353484,0.0005510289,0.0005851531,0.000306671,0.001924528,0.001601859,0.02478946],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02174162,"threshold_uncertainty_score":0.07273299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01729256799778458,"score_gpt":0.2769583647404634,"score_spread":0.2596657967426789,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}