{"id":"W2794534772","doi":"10.1007/978-3-031-58411-4_18","title":"Faster Cryptographic Hash Function from Supersingular Isogeny Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Isogeny; Hash function; Cryptographic hash function; Cryptography; Computer science; Collision resistance; Cryptographic primitive; Mathematics; Cryptographic protocol; Elliptic curve; Perfect hash function; Algorithm; Pure mathematics; Computer security","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.0005913808,0.0008857057,0.001068581,0.001172778,0.0008434666,0.001716942,0.0009693732,0.0008590221,0.01435836],"category_scores_gemma":[0.001719837,0.0004830276,0.0008965288,0.001478675,0.001073489,0.004808313,0.002654562,0.001954309,0.004320155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001026873,"about_ca_system_score_gemma":0.0007838054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003858498,"about_ca_topic_score_gemma":0.0004215002,"domain_scores_codex":[0.9991758,0.0001505623,0.00003973476,0.0001434319,0.0003688259,0.0001215314],"domain_scores_gemma":[0.9988623,0.0003701419,0.00006295089,0.0005198151,0.0001409934,0.00004379038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001380601,0.0001620458,0.0007985467,0.0006596865,0.0001028489,0.0003945503,0.0005217776,0.02417926,0.04455111,0.5720211,0.02743825,0.3277903],"study_design_scores_gemma":[0.0002541495,0.0004032075,0.0007806331,0.000104547,0.0001182303,0.0008935104,0.0001766902,0.095686,0.05712291,0.7961654,0.04819361,0.0001011806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2260242,0.002632938,0.687097,0.001710198,0.0009717719,0.000387145,0.0009837569,0.007113132,0.07307991],"genre_scores_gemma":[0.8067968,0.001110708,0.1439944,0.0007113427,0.0005858004,0.000275903,0.001824859,0.001191407,0.04350871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01435836,"threshold_uncertainty_score":0.04803354,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01086130293996169,"score_gpt":0.211961733627522,"score_spread":0.2011004306875603,"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."}}