{"id":"W2783612059","doi":"","title":"Accelerating Poly1305 cryptographic message authentication on the z14","year":2017,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"IBM (Canada); McMaster University","funders":"","keywords":"Computer science; Cryptography; Elliptic Curve Digital Signature Algorithm; Digital signature; Message authentication code; Throughput; Authentication (law); Parallel computing; Cryptographic protocol; Integer (computer science); Elliptic curve cryptography; Encryption; Theoretical computer science; Public-key cryptography; Algorithm; Hash function; Computer network; Programming language; Operating system; Computer security","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001017975,0.000148187,0.0001104771,0.0002300621,0.001902237,0.001989129,0.00211477,0.00003642584,0.000001752222],"category_scores_gemma":[0.0003523391,0.0001032797,0.00005082826,0.0004597877,0.0003135504,0.0009544695,0.0006424348,0.0001831095,0.000005682583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001491069,"about_ca_system_score_gemma":0.00004884045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008901688,"about_ca_topic_score_gemma":8.031151e-7,"domain_scores_codex":[0.9986156,0.00001838935,0.0001414965,0.0004448097,0.0004355939,0.0003440937],"domain_scores_gemma":[0.9983667,0.0002407352,0.00008180526,0.001090641,0.0001039846,0.0001161129],"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.00000204766,0.00006188414,0.006651252,0.00004318446,0.00003064118,0.00002305849,0.002375137,0.001777925,0.002832913,0.5181808,0.0001781905,0.467843],"study_design_scores_gemma":[0.0001751693,0.00006924316,0.2938225,0.0001433467,0.000006123672,0.00002234377,0.00001077511,0.7006101,0.002015121,0.002264282,0.0005323854,0.0003286033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.158836,0.0001173291,0.8389555,0.001129915,0.0006015867,0.0001148707,3.783052e-7,0.0001906697,0.00005379399],"genre_scores_gemma":[0.9011368,0.00002078525,0.09849327,0.0002284655,0.00009886666,0.00001099596,1.346088e-7,0.000006129614,0.000004616343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7423007,"threshold_uncertainty_score":0.9993972,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01718539514733581,"score_gpt":0.2241910482978497,"score_spread":0.2070056531505139,"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."}}