{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00106691,0.0007643595,0.0006660426,0.001245506,0.0005433265,0.0006143563,0.004214449,0.000399172,0.00007707744],"category_scores_gemma":[0.000107839,0.0007153618,0.000343042,0.0009113739,0.001578327,0.0004288105,0.0009365948,0.001139327,0.0001111932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002719626,"about_ca_system_score_gemma":0.000297865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001505488,"about_ca_topic_score_gemma":0.00003689008,"domain_scores_codex":[0.9952839,0.00009997597,0.000548052,0.002057922,0.001063206,0.0009469301],"domain_scores_gemma":[0.9964114,0.0007949995,0.0003008409,0.002033224,0.0001466457,0.0003128282],"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.00006684173,0.0001455759,0.00005190647,0.00005433763,0.00003254382,0.0001356304,0.0008233238,0.03852525,0.00007500579,0.4550955,0.0005094566,0.5044846],"study_design_scores_gemma":[0.0008034506,0.0004594826,0.0001471522,0.0004137579,0.00001279825,0.00005683649,2.298426e-7,0.1743872,0.0007940708,0.8181264,0.003400145,0.001398524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002874748,0.0001368083,0.9867554,0.0008893238,0.002581057,0.0004070044,0.00001074396,0.0002509085,0.008681219],"genre_scores_gemma":[0.2348767,0.00004608936,0.7509857,0.0129226,0.0006445762,0.00002461087,0.00001043418,0.00009035342,0.0003989129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5030861,"threshold_uncertainty_score":0.9995297,"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."}}