{"id":"W3130406170","doi":"10.1109/tvlsi.2021.3058509","title":"An Efficient and High-Speed Overlap-Free Karatsuba-Based Finite-Field Multiplier for FGPA Implementation","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"FedDev Ontario","keywords":"Operand; Elliptic curve cryptography; Field-programmable gate array; Cryptography; Computer science; Multiplier (economics); Finite field; Public-key cryptography; Key (lock); Gate array; Multiplication (music); Computer hardware; Parallel computing; Arithmetic; Embedded system; Algorithm; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000436974,0.0002758103,0.0002969211,0.0003382325,0.0005576254,0.0004871788,0.0003712134,0.0001831616,0.00004810644],"category_scores_gemma":[0.00002626447,0.0002536055,0.000207481,0.0005921908,0.00004123836,0.0003840995,0.000004905179,0.0002372376,0.00001388006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008008845,"about_ca_system_score_gemma":0.0001204007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000203707,"about_ca_topic_score_gemma":0.0009179431,"domain_scores_codex":[0.9977322,0.0002351547,0.0005257549,0.0006919457,0.0004329145,0.0003820732],"domain_scores_gemma":[0.9978386,0.0006487622,0.0001443257,0.0008436994,0.0003521243,0.0001724873],"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.0007759809,0.005349018,0.0007314351,0.0006963031,0.0004855776,0.00007232682,0.008086715,0.7412124,0.1004885,0.03146782,0.00283669,0.1077972],"study_design_scores_gemma":[0.002939749,0.0005518546,0.000375035,0.0001246455,0.00006254007,0.00001272464,0.001854235,0.8118347,0.1808144,0.0001732652,0.0008716258,0.0003852377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07102909,0.0001068681,0.92506,0.0006319211,0.001957934,0.0007299738,0.0002661364,0.0001794847,0.00003862035],"genre_scores_gemma":[0.9872531,0.00001666614,0.01191918,0.0003405588,0.00008843066,0.0002004735,0.00006047147,0.00002276416,0.000098378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.916224,"threshold_uncertainty_score":0.9999916,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01139373177462619,"score_gpt":0.2656827451022813,"score_spread":0.2542890133276551,"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."}}