{"id":"W2075501204","doi":"10.1109/mwscas.2010.5548774","title":"Efficient VLSI implementation of a finite field multiplier using reordered normal basis","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"NIST; Multiplier (economics); Clock rate; Very-large-scale integration; Finite field; Computer science; Elliptic curve cryptography; Normal basis; Domino logic; Cryptography; Arithmetic; Parallel computing; CMOS; Application-specific integrated circuit; Public-key cryptography; Computer hardware; Embedded system; Chip; Logic synthesis; Electronic engineering; Logic gate; Mathematics; Algorithm; Engineering; Galois theory; Discrete mathematics; Encryption; Logic family","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.0002674229,0.00007005207,0.00007802411,0.0001209327,0.00008654331,0.00003780342,0.0003040819,0.00003685934,0.0003461392],"category_scores_gemma":[0.00002673909,0.00006305899,0.00007103605,0.0003211898,0.00002338242,0.00008671156,0.0001345075,0.00009039917,0.000004904256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003277911,"about_ca_system_score_gemma":0.00002761368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001030857,"about_ca_topic_score_gemma":0.00009783902,"domain_scores_codex":[0.999346,0.00002721714,0.000174961,0.000168532,0.0001319173,0.0001514067],"domain_scores_gemma":[0.999347,0.0001665048,0.00006893488,0.0003197678,0.00005763585,0.00004019],"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.00007464152,0.0002741909,0.02112855,0.00004857937,0.00006381602,0.000005658144,0.005246317,0.003433766,0.2555224,0.3635637,0.0002069313,0.3504315],"study_design_scores_gemma":[0.001299066,0.0003126308,0.01091245,0.00001718993,0.00002833317,0.000008087668,0.0005014028,0.5491254,0.4319001,0.004610243,0.000905339,0.0003797599],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6012269,0.000001887273,0.3974034,0.00009843248,0.0001861498,0.00005942388,0.000001014367,0.00003590594,0.0009868833],"genre_scores_gemma":[0.9144028,3.548979e-7,0.0853899,0.0001650872,0.00002069127,0.000002952995,5.635198e-7,0.000002800179,0.00001485929],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5456916,"threshold_uncertainty_score":0.3789982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01307316342711494,"score_gpt":0.2767760127203315,"score_spread":0.2637028492932165,"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."}}