{"id":"W1824465360","doi":"10.1007/978-3-540-45238-6_16","title":"On Low Complexity Bit Parallel Polynomial Basis Multipliers","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplier (economics); Finite field; Polynomial basis; Mathematics; Irreducible polynomial; Verilog; Basis (linear algebra); Arithmetic; Polynomial; Finite field arithmetic; Discrete mathematics; Algebra over a field; Computer science; Field-programmable gate array; Pure mathematics; Matrix polynomial; Mathematical analysis; Computer hardware","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.0007184586,0.00166629,0.0007556147,0.001281428,0.001006505,0.002024044,0.001261453,0.0007555755,0.02540007],"category_scores_gemma":[0.003651558,0.0006725425,0.000546284,0.002519339,0.001092937,0.004491066,0.002856647,0.002360285,0.007076643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001057824,"about_ca_system_score_gemma":0.0009070176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005642895,"about_ca_topic_score_gemma":0.001651036,"domain_scores_codex":[0.9991626,0.0001949792,0.00004085233,0.00009008465,0.0004186053,0.00009303018],"domain_scores_gemma":[0.9990209,0.0004901889,0.00006845404,0.0002600105,0.0001204307,0.00003998917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005254284,0.0001216531,0.0002993271,0.0002670259,0.00003782456,0.0001266106,0.000118143,0.02058754,0.01174428,0.6520695,0.02597,0.2881327],"study_design_scores_gemma":[0.0001290705,0.0001111298,0.000233684,0.0001029056,0.00004559357,0.0002998465,0.00005188549,0.08276483,0.0114931,0.8559548,0.04877165,0.00004137634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04613623,0.002571564,0.7920123,0.001956948,0.001314301,0.0002627805,0.0004995189,0.001922889,0.1533235],"genre_scores_gemma":[0.2793203,0.003440568,0.5509892,0.00119758,0.001083788,0.0006823196,0.001087392,0.001326576,0.1608723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02540007,"threshold_uncertainty_score":0.08497173,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02197533117921908,"score_gpt":0.2365140961605214,"score_spread":0.2145387649813023,"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."}}