{"id":"W2051417138","doi":"10.1117/12.506144","title":"High-performance finite field multiplier for cryptographic applications","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Elliptic Curve Digital Signature Algorithm; Computer science; Finite field arithmetic; Elliptic curve cryptography; NIST; Field-programmable gate array; Multiplier (economics); Parallel computing; Cryptography; Binary number; Multiplication (music); Arithmetic; Lookup table; Computational science; Mathematics; Computer hardware; Algorithm; Public-key cryptography; Discrete mathematics; Encryption","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.000553457,0.0002709829,0.0003158272,0.0001704763,0.0001786491,0.0001485372,0.001401509,0.0001810769,0.00000492999],"category_scores_gemma":[0.000379566,0.0002260121,0.0006097329,0.0007011739,0.0001615781,0.0005890399,0.0001276898,0.0002516167,0.000001328731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004008215,"about_ca_system_score_gemma":0.0000328774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003956064,"about_ca_topic_score_gemma":1.040124e-7,"domain_scores_codex":[0.9981095,1.528308e-8,0.0005607346,0.0004470359,0.0004696824,0.0004130308],"domain_scores_gemma":[0.9978418,0.0004095093,0.0002906219,0.000110861,0.001233351,0.0001138327],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002585556,0.0001277603,0.0004526026,0.0003499647,0.0002259567,2.050206e-8,0.0001060346,0.0003225228,0.07666042,0.919637,0.0008777778,0.001214032],"study_design_scores_gemma":[0.004724654,0.001562135,0.003680841,0.0005929632,0.0003564379,0.00003415993,0.0008235084,0.2169213,0.66425,0.05567921,0.04982495,0.00154993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9691436,0.0001273605,0.0267295,0.001659352,0.0002681087,0.000924235,0.00002054553,0.0001160519,0.001011234],"genre_scores_gemma":[0.4342583,0.0001357505,0.5644822,0.0001767185,0.0001752539,0.0006706549,0.00000320979,0.00003030875,0.00006763569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8639578,"threshold_uncertainty_score":0.9216505,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008559537215350646,"score_gpt":0.2145483139918568,"score_spread":0.2059887767765061,"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."}}