{"id":"W218666475","doi":"10.1007/978-3-642-42045-0_24","title":"A Heuristic for Finding Compatible Differential Paths with Application to HAS-160","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hash function; Computer science; Heuristic; Collision; Algorithm; Differential (mechanical device); Theoretical computer science; Artificial intelligence; Programming language; Physics","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.001200849,0.001043726,0.001198781,0.002829692,0.00162864,0.001514486,0.001837218,0.001413683,0.01189787],"category_scores_gemma":[0.006284748,0.0006301293,0.0014586,0.002474549,0.001481616,0.0024081,0.003028706,0.001357845,0.001431509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001054382,"about_ca_system_score_gemma":0.002015016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001472235,"about_ca_topic_score_gemma":0.002470861,"domain_scores_codex":[0.9990909,0.0002033673,0.00006480835,0.0002090234,0.0002702412,0.0001616879],"domain_scores_gemma":[0.9976476,0.001271257,0.0001166221,0.0004435352,0.0003847086,0.0001362229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008610602,0.0005607724,0.003878231,0.0006248141,0.0001328621,0.0005062834,0.0006665952,0.08794042,0.01787511,0.2138262,0.009873849,0.6632538],"study_design_scores_gemma":[0.0002128858,0.0004805555,0.0009206393,0.0001263981,0.0001653998,0.0006703275,0.0005778368,0.6075954,0.01813121,0.3575673,0.01346669,0.00008535176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06996749,0.0002226561,0.9141172,0.000359612,0.0001234194,0.0004947479,0.0003076109,0.001587504,0.01281982],"genre_scores_gemma":[0.2101312,0.00008467722,0.7850156,0.0001166705,0.00002784187,0.0001591943,0.0005246826,0.0002168705,0.003723324],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01189787,"threshold_uncertainty_score":0.03980231,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02392205261681029,"score_gpt":0.2705649053188203,"score_spread":0.24664285270201,"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."}}