{"id":"W2149204794","doi":"10.1109/tc.2004.47","title":"Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":242,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Trinomial; Polynomial basis; Multiplier (economics); Multiplication (music); Irreducible polynomial; GF(2); Mathematics; Finite field arithmetic; Primitive polynomial; Arithmetic; Polynomial; Matrix multiplication; Discrete mathematics; Computer science; Matrix polynomial; Combinatorics","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.0001118113,0.0002432002,0.0002169571,0.0003503959,0.0004556835,0.000139736,0.0006864045,0.0001003035,0.000007645794],"category_scores_gemma":[0.00000225631,0.0002311176,0.0003470175,0.0004759012,0.0001590751,0.0001202021,0.000005923181,0.0002272635,0.00001910243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008121479,"about_ca_system_score_gemma":0.00006851986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001819998,"about_ca_topic_score_gemma":0.0001585506,"domain_scores_codex":[0.9984819,0.00004993699,0.0002762181,0.0005683577,0.0002501192,0.0003735234],"domain_scores_gemma":[0.9988847,0.0002259498,0.00008332726,0.0005945611,0.00005617458,0.0001553338],"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.0001212031,0.0007048628,0.0000203069,0.00004395243,0.00009976063,0.000004598626,0.0008388769,0.8638676,0.0009770012,0.002075817,0.0003674298,0.1308786],"study_design_scores_gemma":[0.01243186,0.001475459,0.01764209,0.0002783984,0.0001252487,0.0001014912,0.00004460104,0.8355883,0.1094717,0.01931191,0.001711769,0.001817185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06233222,0.00001814767,0.9340206,0.001645454,0.001075225,0.0005410055,0.0000351101,0.000303785,0.00002848106],"genre_scores_gemma":[0.7646026,0.000006126675,0.2345812,0.0006243513,0.00008136847,0.00007725094,0.000002973822,0.00001446323,0.00000969774],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7022704,"threshold_uncertainty_score":0.9424703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02133126280777332,"score_gpt":0.2522161742658325,"score_spread":0.2308849114580592,"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."}}