{"id":"W2106641903","doi":"10.1109/tc.2007.1047","title":"Comb Architectures for Finite Field Multiplication in F(2^m)","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Normal basis; Finite field; Basis (linear algebra); Critical path method; Multiplier (economics); Binary number; Field-programmable gate array; Computer science; Adder; Polynomial basis; Algorithm; Multiplication (music); Field (mathematics); Path (computing); Representation (politics); Mathematics; Arithmetic; Parallel computing; Discrete mathematics; Computer hardware; Latency (audio); Combinatorics; Galois theory","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.00033742,0.0001153039,0.0001075568,0.0003837916,0.0001303957,0.00004678686,0.0004405432,0.00006063619,0.000003470624],"category_scores_gemma":[0.000005273519,0.0001183514,0.0001248162,0.0004389127,0.00002597095,0.00005785439,0.000002241977,0.0001722535,0.000006571444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002342314,"about_ca_system_score_gemma":0.00001307035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001511818,"about_ca_topic_score_gemma":0.00008378431,"domain_scores_codex":[0.999133,0.00003403395,0.0001963707,0.0002905735,0.0001066893,0.0002393542],"domain_scores_gemma":[0.9980695,0.001454679,0.00003950536,0.0003466842,0.00002712846,0.00006249953],"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.0001602632,0.0002540917,0.00007021277,0.00001553236,0.00002235429,0.00000446114,0.001088053,0.118726,0.0005548747,0.006319796,0.0001184367,0.8726659],"study_design_scores_gemma":[0.003100363,0.001321197,0.002946927,0.0001682505,0.00001893392,0.00002038356,0.00006148369,0.8451104,0.1160106,0.02659287,0.00385428,0.0007943281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02696863,0.000008771366,0.9711431,0.0005575967,0.0007532777,0.0002599239,0.000002836223,0.0001641768,0.0001417235],"genre_scores_gemma":[0.9333647,0.000001821943,0.06554913,0.001002935,0.00003068147,0.00002978003,5.649167e-7,0.000006572729,0.00001376785],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9063961,"threshold_uncertainty_score":0.4826232,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01617108888284695,"score_gpt":0.2593328631153665,"score_spread":0.2431617742325196,"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."}}