{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002579149,0.0003570814,0.0002150989,0.0005864699,0.0003125321,0.0003707217,0.0004411896,0.0002827634,0.0034497],"category_scores_gemma":[0.0006855861,0.0001257936,0.0002073957,0.0004258115,0.0002533379,0.0008205481,0.000293015,0.0003349798,0.0008190181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002365155,"about_ca_system_score_gemma":0.000317559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001712396,"about_ca_topic_score_gemma":0.0005826476,"domain_scores_codex":[0.9999106,0.00002307903,0.000007469856,0.00001409517,0.00003456329,0.00001019791],"domain_scores_gemma":[0.9997495,0.00006902155,0.0000528793,0.00004478875,0.00006933308,0.00001441537],"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.000711957,0.0001836927,0.001066139,0.000403167,0.00005898727,0.0005396634,0.0001777887,0.01616171,0.1455103,0.1207264,0.005310237,0.7091501],"study_design_scores_gemma":[0.0004060635,0.002174568,0.002682507,0.0001676469,0.000128201,0.003192595,0.0001649331,0.5772177,0.2449607,0.08376845,0.08499052,0.000146034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1208551,0.0009227357,0.8657433,0.0002101952,0.0002119953,0.0001460772,0.0001075157,0.0009985857,0.01080441],"genre_scores_gemma":[0.4236603,0.0004657981,0.5675986,0.000121962,0.0001329204,0.000137811,0.0001749674,0.00004366516,0.00766394],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0034497,"threshold_uncertainty_score":0.01154041,"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."}}