{"id":"W1513787550","doi":"10.1007/978-3-642-01877-0_14","title":"ERINDALE: A Polynomial Based Hashing Algorithm","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hash function; Computer science; Double hashing; Algorithm; Flexibility (engineering); Set (abstract data type); Field-programmable gate array; Software; SHA-2; Polynomial; Skein; Theoretical computer science; Hash table; Cryptographic hash function; Computer hardware; Mathematics; Programming language; Statistics","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.000714687,0.0006611522,0.001006795,0.0008981084,0.0009156055,0.001474816,0.00241679,0.001040056,0.01706859],"category_scores_gemma":[0.00140242,0.0004578607,0.0006625386,0.001406308,0.0009061361,0.00395949,0.004053104,0.001745591,0.009534816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006227918,"about_ca_system_score_gemma":0.0007715675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000289891,"about_ca_topic_score_gemma":0.0003886659,"domain_scores_codex":[0.9990327,0.0001492828,0.00005678294,0.0001707503,0.0004533703,0.0001370319],"domain_scores_gemma":[0.999455,0.00007777054,0.0000296174,0.0003005463,0.00009474974,0.00004229271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007730251,0.0002204984,0.00037923,0.0004684947,0.00007116888,0.0001543959,0.0001963893,0.006123247,0.02579108,0.2056251,0.03883527,0.7213621],"study_design_scores_gemma":[0.0005755096,0.00105192,0.001225207,0.0001798685,0.000164534,0.0021088,0.0002339269,0.1390227,0.1027494,0.3677392,0.3846383,0.0003106121],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01669748,0.001664036,0.9419266,0.0005105218,0.0006837724,0.0002725477,0.0004809492,0.009600358,0.02816384],"genre_scores_gemma":[0.2711278,0.001093107,0.6540549,0.0008182608,0.0003478325,0.0003468126,0.002227569,0.00144674,0.06853682],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01706859,"threshold_uncertainty_score":0.05710012,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01643228080212927,"score_gpt":0.261587612840424,"score_spread":0.2451553320382947,"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."}}