{"id":"W1969341770","doi":"10.1006/jsco.1999.0309","title":"Algorithms for Exponentiation in Finite Fields","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Exponentiation; Mathematics; Normal basis; Finite field; Modular exponentiation; Multiplication (music); Division (mathematics); Basis (linear algebra); Polynomial; Polynomial basis; Combinatorics; Element (criminal law); Prime (order theory); Discrete mathematics; Arithmetic; Mathematical analysis; Geometry; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0004748263,0.00005803244,0.0001193369,0.0002429182,0.00004454766,0.00006489635,0.0002170077,0.00003770028,0.00001861755],"category_scores_gemma":[0.00002474991,0.00005536953,0.00009389047,0.0003193643,0.00000885288,0.0004118713,0.00001124353,0.00008877408,0.000003875929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001788497,"about_ca_system_score_gemma":0.00002843869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002742545,"about_ca_topic_score_gemma":0.000001638489,"domain_scores_codex":[0.9992911,0.0000528645,0.0003241223,0.00008785182,0.0001412138,0.0001028895],"domain_scores_gemma":[0.9994408,0.0002083023,0.0001505898,0.00007318987,0.00009242625,0.00003463936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000507271,0.00009838067,0.0003214021,0.0000112822,0.00001542382,0.000006741729,0.00230114,0.04473567,0.00009256605,0.008317469,0.0002710097,0.9437782],"study_design_scores_gemma":[0.001738778,0.0005172685,0.02225335,0.00009911087,0.00001351322,0.00006029259,0.00007092069,0.7321569,0.0003856062,0.2401823,0.002342522,0.0001794472],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.232654,0.00006584694,0.7663129,0.0004529505,0.0002218766,0.00006305123,3.701731e-7,0.00001250025,0.0002164428],"genre_scores_gemma":[0.9650514,0.00002336474,0.03462863,0.0001393515,0.000126151,0.000002791222,0.00000118784,0.000003135843,0.00002396794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9435987,"threshold_uncertainty_score":0.2257904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01953647114672561,"score_gpt":0.2727223051112659,"score_spread":0.2531858339645403,"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."}}