{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005722468,0.0004789899,0.0005687141,0.0005666215,0.0004824497,0.001274612,0.0005504481,0.0003900204,0.00354999],"category_scores_gemma":[0.001885098,0.0002143032,0.0002834866,0.0008218329,0.0006865587,0.002644187,0.001207961,0.0007627332,0.001541293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003754717,"about_ca_system_score_gemma":0.0006958628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002187268,"about_ca_topic_score_gemma":0.00040952,"domain_scores_codex":[0.9993918,0.0001302649,0.00004923155,0.0001000572,0.0002346944,0.00009393466],"domain_scores_gemma":[0.9992961,0.0002397161,0.00006385918,0.0002029284,0.0001637583,0.00003365871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007373163,0.0001332612,0.0007688447,0.0002381218,0.00002564671,0.0002122903,0.0002308775,0.03050747,0.06344748,0.4458403,0.007501408,0.450357],"study_design_scores_gemma":[0.0001194576,0.0006107677,0.0003692328,0.00007798822,0.00002487014,0.000846603,0.000129502,0.3506756,0.08540086,0.5144703,0.04722327,0.00005151704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1019728,0.001164282,0.8708408,0.0003682517,0.0002487743,0.00009888859,0.0001048038,0.001315845,0.02388548],"genre_scores_gemma":[0.5635933,0.0007711024,0.4250753,0.0001266367,0.0001548735,0.00007918386,0.0002791845,0.0001095595,0.009810916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00354999,"threshold_uncertainty_score":0.01187593,"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."}}