{"id":"W2080805739","doi":"10.1109/icccas.2006.285197","title":"Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Finite field; Computer science; Arithmetic; Bit (key); Computational complexity theory; Polynomial basis; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics","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.0003343003,0.0005652183,0.0004724721,0.0006927315,0.0006458946,0.0006115329,0.0005245263,0.0003747811,0.003703335],"category_scores_gemma":[0.0008772083,0.0002080687,0.0005084104,0.0006693383,0.0004626296,0.001479041,0.0005385436,0.00104399,0.0007026189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004342712,"about_ca_system_score_gemma":0.0005857534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000167833,"about_ca_topic_score_gemma":0.0002908236,"domain_scores_codex":[0.9997615,0.00004371351,0.00001456462,0.00004441401,0.00009937318,0.00003639157],"domain_scores_gemma":[0.9995916,0.0001826733,0.00006283061,0.00008206347,0.00005821542,0.00002250116],"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.00114949,0.0002369299,0.001367861,0.001138784,0.000127949,0.00064759,0.0002177342,0.03946442,0.1829653,0.4412154,0.007276437,0.3241921],"study_design_scores_gemma":[0.0006466216,0.001178592,0.001598488,0.0001788181,0.0002381141,0.003539354,0.00008483362,0.3723556,0.1884912,0.3572435,0.07428004,0.0001648976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1207739,0.001998545,0.8544839,0.0006242853,0.0002511302,0.0002261801,0.0002058044,0.000769342,0.02066691],"genre_scores_gemma":[0.6088262,0.00251378,0.3734817,0.0002863363,0.0004195423,0.0003219535,0.0004791654,0.0001298844,0.01354142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003703335,"threshold_uncertainty_score":0.01238889,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02778535311224118,"score_gpt":0.2459758568665396,"score_spread":0.2181905037542985,"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."}}