{"id":"W1866966051","doi":"10.1007/978-3-540-85538-5_17","title":"Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Supersingular elliptic curve; Hyperelliptic curve cryptography; Hyperelliptic curve; Automorphism; Pairing; Genus; Edwards curve; Elliptic curve; Computer science; Cryptography; Computation; Prime (order theory); Mathematics; Embedding; Finite field; Discrete mathematics; Schoof's algorithm; Algorithm; Pure mathematics; Elliptic curve cryptography; Combinatorics; Public-key cryptography; Encryption; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006293338,0.000805465,0.0007985882,0.001582178,0.0008503329,0.0005468056,0.00297705,0.0002656784,0.00001642733],"category_scores_gemma":[0.00004707283,0.0006723235,0.0002210511,0.00172358,0.001305254,0.0004836679,0.0008381109,0.001212616,0.00008679445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002568793,"about_ca_system_score_gemma":0.0005828948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000031368,"about_ca_topic_score_gemma":0.00002527508,"domain_scores_codex":[0.9945722,0.00005638403,0.000642504,0.001994776,0.001706818,0.001027313],"domain_scores_gemma":[0.9966745,0.0009240786,0.0003815196,0.00136462,0.0003471785,0.0003081274],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001469887,0.0001313794,0.0001186543,0.0001912952,0.00005203114,0.0005713552,0.001258318,0.7771274,0.00003614768,0.009219559,0.0003152063,0.2109639],"study_design_scores_gemma":[0.0007906124,0.0008272447,0.0005231859,0.00411731,0.00003601885,0.0008834772,5.64734e-7,0.9795218,0.0006083206,0.008852338,0.002409953,0.001429198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001082095,0.002374104,0.9900146,0.0008518696,0.001997968,0.0006517669,0.000007208097,0.0004340572,0.002586296],"genre_scores_gemma":[0.4250722,0.0009524511,0.5684727,0.00408725,0.0006879261,0.00002277979,0.00002294285,0.0001363529,0.0005453414],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4239901,"threshold_uncertainty_score":0.9995728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02028527044326889,"score_gpt":0.2272133664758297,"score_spread":0.2069280960325608,"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."}}