{"id":"W2154757782","doi":"10.1109/iscas.2008.4542158","title":"A high speed word level finite field multiplier using reordered normal basis","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Computer science; Finite field; Very-large-scale integration; Basis (linear algebra); Permutation (music); Critical path method; Word (group theory); Adder; Word length; Architecture; Arithmetic; Algorithm; Mathematics; Discrete mathematics; Embedded system; Engineering","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.0001829491,0.0001487471,0.0001576534,0.0001693555,0.0003075007,0.00006951001,0.0006183751,0.00007443692,0.0003191786],"category_scores_gemma":[0.00006837807,0.0001357042,0.0001258498,0.0006222618,0.00005218892,0.0003970659,0.000257464,0.0001445165,0.00005566249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001181766,"about_ca_system_score_gemma":0.00004405944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001762501,"about_ca_topic_score_gemma":0.00002362001,"domain_scores_codex":[0.9988941,0.0000577719,0.0002030157,0.000332522,0.0001976413,0.0003149301],"domain_scores_gemma":[0.9989467,0.0003046115,0.00005548493,0.0005410157,0.00005757486,0.00009461516],"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.0006196389,0.001093283,0.03623143,0.00007429979,0.0003946893,0.0007478944,0.01081408,0.008081146,0.02135172,0.5133918,0.01353154,0.3936685],"study_design_scores_gemma":[0.008028167,0.00104348,0.06486947,0.0002271117,0.00009589441,0.0006619476,0.0003605601,0.6445245,0.1745376,0.0743526,0.02711906,0.004179607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3775933,0.0000158993,0.6177908,0.0003948046,0.0003054355,0.00007108735,0.000001746135,0.000189713,0.003637155],"genre_scores_gemma":[0.8176635,0.000007180841,0.1803658,0.001046032,0.00007066438,0.000001634517,8.349784e-7,0.000006861757,0.0008374267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6364434,"threshold_uncertainty_score":0.5533856,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0625180271145517,"score_gpt":0.247560202414532,"score_spread":0.1850421752999803,"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."}}