{"id":"W2887945679","doi":"10.1109/tvlsi.2018.2851958","title":"Efficient VLSI Implementation of a Sequential Finite Field Multiplier Using Reordered Normal Basis in Domino Logic","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Domino logic; Multiplier (economics); Very-large-scale integration; Finite field; CMOS; Critical path method; Computer science; Elliptic curve cryptography; Parallel computing; Arithmetic; Electronic engineering; Logic gate; Logic synthesis; Mathematics; Logic family; Algorithm; Embedded system; Engineering; Discrete mathematics; Encryption","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":[],"consensus_categories":[],"category_scores_codex":[0.00056867,0.0002348313,0.0003067504,0.0006797028,0.0003006204,0.0001358564,0.0003423527,0.0001786537,0.0001297537],"category_scores_gemma":[0.00001063427,0.0002122614,0.0002156456,0.0009865207,0.00008448103,0.0002740756,0.000007371506,0.0002601676,0.0000285045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001198492,"about_ca_system_score_gemma":0.00009631676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001375061,"about_ca_topic_score_gemma":0.002623784,"domain_scores_codex":[0.9976642,0.0002873309,0.0007614339,0.000473071,0.0004335038,0.0003804332],"domain_scores_gemma":[0.998745,0.0002058619,0.0002356834,0.0004685762,0.0002611172,0.00008378218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001488911,0.004777607,0.002952741,0.0007194814,0.0006194229,0.00007813996,0.05171537,0.6525273,0.1703229,0.00735895,0.0005066279,0.1069326],"study_design_scores_gemma":[0.002093497,0.000582711,0.0007150162,0.0002574759,0.00005560018,0.00002332782,0.002847522,0.802702,0.1901992,0.00006237481,0.0001168749,0.0003444642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3084095,0.00002485095,0.6893929,0.00008660461,0.001458737,0.0004243325,0.00004295393,0.00005450536,0.0001056019],"genre_scores_gemma":[0.9929486,0.000009090255,0.006733286,0.00008848549,0.00008801595,0.00006707644,0.000006261141,0.00001352616,0.00004567403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6845391,"threshold_uncertainty_score":0.8655769,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02018227927391735,"score_gpt":0.2865310725754582,"score_spread":0.2663487933015408,"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."}}