{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001717798,0.00008390052,0.0001281737,0.0000779938,0.00007213494,0.00003408377,0.0004616111,0.00005197277,0.00003779355],"category_scores_gemma":[0.00001621674,0.00007211423,0.0001366035,0.0002185332,0.00007491242,0.0001179645,0.00007415954,0.00005140221,0.00000769345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004123907,"about_ca_system_score_gemma":0.00001439496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004343966,"about_ca_topic_score_gemma":0.00008307702,"domain_scores_codex":[0.999328,0.0000243505,0.0001778287,0.0001983914,0.00009715276,0.0001743102],"domain_scores_gemma":[0.9992213,0.0002777695,0.00005639836,0.0003528977,0.00006126182,0.00003038787],"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.00002379201,0.0001173272,0.0003697757,0.00002376971,0.00000665887,5.857411e-7,0.00007106757,0.001015606,0.0003567195,0.9920121,0.002679287,0.003323329],"study_design_scores_gemma":[0.001100213,0.0002221562,0.00392436,0.00001979746,0.000007385472,0.000001928928,0.00001564041,0.233085,0.0101836,0.741111,0.0100713,0.0002575644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0190989,0.00001603722,0.9662019,0.0004657181,0.0001223308,0.0001451471,0.000005423049,0.0001007681,0.01384379],"genre_scores_gemma":[0.8667894,8.550635e-7,0.1323882,0.0002888785,0.00003809966,0.00001451535,0.000002977923,0.000003305826,0.0004737978],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8476905,"threshold_uncertainty_score":0.2940733,"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."}}