{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009890081,0.0008730653,0.001128616,0.001348295,0.0007311305,0.001254013,0.00105461,0.0006022098,0.01392997],"category_scores_gemma":[0.002523048,0.0005101033,0.0005773814,0.001669808,0.0006610929,0.003420781,0.001882968,0.0007751391,0.004411709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007758544,"about_ca_system_score_gemma":0.001668661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001360007,"about_ca_topic_score_gemma":0.002449852,"domain_scores_codex":[0.9987276,0.0001739429,0.00009324321,0.0002050198,0.0006114497,0.0001886736],"domain_scores_gemma":[0.9987016,0.0003916134,0.0001036821,0.0005234368,0.000214505,0.00006518338],"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.001789177,0.0002924957,0.001885649,0.0004642297,0.000152327,0.0002048924,0.0003269065,0.008832847,0.07773141,0.04825671,0.0133605,0.8467029],"study_design_scores_gemma":[0.001762179,0.002582035,0.007252275,0.0004988051,0.0006066796,0.00309448,0.000722585,0.4058517,0.3290318,0.1274957,0.1205506,0.0005511488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1910909,0.00569172,0.7685736,0.000747103,0.001054758,0.0003971002,0.0005269651,0.01089795,0.02101979],"genre_scores_gemma":[0.5872691,0.000714872,0.394454,0.0004421358,0.0002533386,0.0001743454,0.001038731,0.0003269054,0.01532652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01392997,"threshold_uncertainty_score":0.04660034,"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."}}