{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002915926,0.000318697,0.0002217597,0.0003653682,0.0002919604,0.0005242612,0.0004859137,0.0003913724,0.01235441],"category_scores_gemma":[0.0007421849,0.0001408263,0.0001615153,0.0005635778,0.000126912,0.0006910372,0.0002347011,0.0004145941,0.002972116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003786809,"about_ca_system_score_gemma":0.0004307897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002416059,"about_ca_topic_score_gemma":0.0004535094,"domain_scores_codex":[0.9998828,0.00002678213,0.000007781387,0.00001914617,0.0000474925,0.00001600897],"domain_scores_gemma":[0.9997975,0.00005528502,0.00002372368,0.00003365107,0.00007521352,0.00001464719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009985903,0.0001847307,0.001731761,0.0004679254,0.00005355102,0.0005463772,0.0001574441,0.01189514,0.421638,0.056115,0.01553583,0.4906757],"study_design_scores_gemma":[0.0003565607,0.003261496,0.003786516,0.0002542178,0.0001049476,0.003098112,0.0001382178,0.1959753,0.5528879,0.02858389,0.2114248,0.0001280436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3318489,0.00608797,0.5931737,0.001360927,0.0006255887,0.0002877498,0.0003835685,0.007340437,0.05889114],"genre_scores_gemma":[0.7403451,0.001045311,0.2413323,0.000170873,0.0001207196,0.0000901129,0.0003433233,0.00007720868,0.01647499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01235441,"threshold_uncertainty_score":0.04132962,"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."}}