{"id":"W1593464237","doi":"10.1007/3-540-45311-3_4","title":"A Parallel Algorithm for Extending Cryptographic Hash Functions","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hash function; Cryptographic hash function; Secure Hash Algorithm; SHA-2; Cryptography; Algorithm; Theoretical computer science; Domain (mathematical analysis); Double hashing; Function (biology); Parallel computing; Mathematics; Programming language","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008927792,0.0005549041,0.0005116998,0.001859516,0.0008304101,0.000831404,0.002359074,0.0002754989,0.0000612073],"category_scores_gemma":[0.00003751478,0.0005430251,0.0003519132,0.00145092,0.0006015605,0.000685905,0.0007104664,0.0006051455,0.00001672558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001654417,"about_ca_system_score_gemma":0.000371377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004015422,"about_ca_topic_score_gemma":0.0002202791,"domain_scores_codex":[0.9959553,0.00002677716,0.0006437993,0.00164649,0.000815682,0.0009119188],"domain_scores_gemma":[0.9973677,0.0005082213,0.0002970215,0.001259399,0.00034789,0.0002197479],"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.000002627615,0.00004217131,0.00003284425,0.00001611906,0.00002165961,0.00002349259,0.0003131021,0.001765844,0.00001467784,0.07997181,0.00009846149,0.9176972],"study_design_scores_gemma":[0.0006416435,0.0002583138,0.000128158,0.0001461354,0.0000212304,0.0001013611,8.877722e-7,0.566182,0.00002534814,0.407579,0.0241549,0.0007610192],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001859446,0.0004968924,0.9941669,0.0006190828,0.002068885,0.0008534675,0.00003700666,0.000229076,0.00151017],"genre_scores_gemma":[0.005621487,0.0001740991,0.992295,0.0009182941,0.0005747658,0.0001015221,0.0000337887,0.00004124319,0.0002397881],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9169362,"threshold_uncertainty_score":0.9997022,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02729200679543531,"score_gpt":0.2818817744945382,"score_spread":0.2545897676991029,"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."}}