{"id":"W2121404865","doi":"10.1007/s13389-015-0110-5","title":"Faster 64-bit universal hashing using carry-less multiplications","year":2015,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Byte; Computer science; Carry (investment); Arithmetic; Parallel computing; Universal hashing; Bit (key); Set (abstract data type); Double hashing; Multiplication (music); Cryptographic hash function; Mathematics; Computer hardware; Computer network; Combinatorics; Computer security; Programming language","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.0003628225,0.000127302,0.0001890013,0.0004514769,0.00006929984,0.0001642215,0.0007016929,0.00005866021,0.000001494718],"category_scores_gemma":[0.00005096483,0.000112823,0.0001109612,0.0005515192,0.00001878089,0.001346573,0.0001830594,0.0002833156,0.000001333892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005620189,"about_ca_system_score_gemma":0.00008676997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000192625,"about_ca_topic_score_gemma":0.000001167103,"domain_scores_codex":[0.9989381,0.00002371329,0.0003243019,0.0001400587,0.00036598,0.0002077756],"domain_scores_gemma":[0.9989158,0.00005601093,0.0002064012,0.0003096819,0.0002680695,0.0002440514],"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.00003510455,0.0002396716,0.007721441,0.00008544621,0.0002998632,0.0003215937,0.004829958,0.8472896,0.07822069,0.03461881,0.0008867124,0.02545117],"study_design_scores_gemma":[0.0007856922,0.00007274232,0.002067504,0.000204481,0.00002525882,0.0003006967,0.0002566214,0.9878283,0.0005324224,0.0003915123,0.007292631,0.0002421563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1225648,0.0003572153,0.8762266,0.0001166943,0.0005990362,0.00003784159,0.000001443226,0.00004513709,0.0000511801],"genre_scores_gemma":[0.6460477,0.00001684584,0.35369,0.00002137611,0.0002076861,5.27831e-7,8.038297e-7,0.00001161849,0.000003366408],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5234829,"threshold_uncertainty_score":0.460079,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0391017793814229,"score_gpt":0.2465031806968069,"score_spread":0.207401401315384,"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."}}