{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002094597,0.0004536062,0.0003109761,0.0003429454,0.0003874778,0.0006478432,0.0007305058,0.0002688097,0.003892644],"category_scores_gemma":[0.000565421,0.0001724127,0.0004242023,0.0006135932,0.0003538246,0.001219435,0.0003219131,0.0006222934,0.0009497562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005895006,"about_ca_system_score_gemma":0.0006638862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005197584,"about_ca_topic_score_gemma":0.002421245,"domain_scores_codex":[0.9997961,0.00004792116,0.00001602718,0.00003398845,0.00007810589,0.00002798556],"domain_scores_gemma":[0.999779,0.00005598958,0.00004438066,0.00006896661,0.00004390119,0.000007830081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004351528,0.0001986801,0.001052302,0.000594519,0.000104781,0.0005020892,0.0002727285,0.1787711,0.1739723,0.3449748,0.005703275,0.2934182],"study_design_scores_gemma":[0.0001267705,0.0007078957,0.0009346969,0.00006136007,0.0001112488,0.0008404683,0.00009545808,0.7385496,0.1086085,0.123298,0.02661194,0.00005397977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1054379,0.0005521302,0.8814443,0.0002211715,0.00007465675,0.0001435246,0.000108585,0.0008135666,0.01120416],"genre_scores_gemma":[0.4825441,0.0006268579,0.507748,0.0001128938,0.0000742545,0.0001584245,0.0002796905,0.00007874623,0.008377079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003892644,"threshold_uncertainty_score":0.01302212,"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."}}