{"id":"W2164336166","doi":"10.1109/tc.2003.1190584","title":"Efficient multiplication beyond optimal normal bases","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Iran University of Science and Technology; University of Tehran","keywords":"Multiplication (music); Finite field; Cryptography; Computer science; Normal basis; Multiplication algorithm; Arithmetic; Basis (linear algebra); Class (philosophy); Field (mathematics); Mathematics; Theoretical computer science; Algorithm; Discrete mathematics; Combinatorics; Galois theory; Pure mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0001558293,0.0001740176,0.000130975,0.0002868061,0.0003331722,0.00011223,0.0004201418,0.00006295284,0.00002097595],"category_scores_gemma":[0.000002255684,0.0001673403,0.000171199,0.0006481221,0.00007226667,0.0001290128,0.000002481261,0.0001885463,0.00007430429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003607816,"about_ca_system_score_gemma":0.00004536842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001404627,"about_ca_topic_score_gemma":0.000004151615,"domain_scores_codex":[0.9987028,0.00009568743,0.0002112639,0.0004259247,0.0002650251,0.0002992621],"domain_scores_gemma":[0.9990519,0.0001846688,0.00005200728,0.000517266,0.00005772362,0.0001364009],"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.000009584865,0.0004360114,0.00001313355,0.000007276834,0.00003431438,0.000009370495,0.0003791684,0.9382094,0.0005836452,0.005249977,0.000167022,0.05490112],"study_design_scores_gemma":[0.0009477673,0.0002410576,0.0004254511,0.00003084301,0.00002278989,0.00007732134,0.0000379559,0.9501572,0.04572592,0.0001266661,0.001803422,0.000403548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03546693,0.00003059268,0.961948,0.0002566215,0.00132988,0.0001894499,0.000004497661,0.0002406898,0.0005333232],"genre_scores_gemma":[0.8468238,0.00000708653,0.1527676,0.0003169882,0.00001775287,0.00002444616,6.121732e-7,0.000009090732,0.00003265658],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8113568,"threshold_uncertainty_score":0.682394,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009442735712164141,"score_gpt":0.2186352816508348,"score_spread":0.2091925459386707,"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."}}