{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001336261,0.0003140012,0.0002178786,0.0003788435,0.000324919,0.0004495834,0.0006013145,0.0002167696,0.002415918],"category_scores_gemma":[0.0002623701,0.0001223421,0.0001843005,0.0003366412,0.0001993737,0.0006495991,0.0001821393,0.0002115858,0.0004828502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003567729,"about_ca_system_score_gemma":0.0005660211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007180725,"about_ca_topic_score_gemma":0.00223064,"domain_scores_codex":[0.999898,0.00001801396,0.000008557665,0.00002167014,0.00003196828,0.00002187136],"domain_scores_gemma":[0.9998784,0.00003269187,0.00001847126,0.00001810279,0.00004268079,0.000009654249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005335944,0.000187354,0.001111386,0.0002901859,0.00006710822,0.000677317,0.0002355456,0.02935056,0.5802507,0.03141366,0.002699767,0.3531828],"study_design_scores_gemma":[0.0002536968,0.002194226,0.00150414,0.00006542346,0.0001299033,0.001722312,0.00015211,0.5163984,0.421978,0.01550588,0.04002162,0.00007441847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3322994,0.0007686634,0.6498561,0.0002896119,0.0001886263,0.0001690118,0.0001334339,0.002230695,0.01406445],"genre_scores_gemma":[0.7667611,0.000318421,0.2270411,0.0001000812,0.00004238799,0.00006010105,0.0001704645,0.00004085774,0.005465592],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002415918,"threshold_uncertainty_score":0.008082092,"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."}}