{"id":"W4414869299","doi":"10.62056/a0l2i888","title":"A Tight Lower Bound on the TdScrypt Trapdoor Memory-Hard Function","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Hash function; Function (biology); Multiplicative function; Modulo; Boolean function; Perfect hash function; Discrete logarithm","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":[],"consensus_categories":[],"category_scores_codex":[0.0006645774,0.0001669557,0.0002092583,0.0003742356,0.0005483311,0.0001413643,0.003803605,0.0001525864,0.00008149432],"category_scores_gemma":[0.0001702864,0.0001338289,0.0001149603,0.001439351,0.0004694215,0.0002799063,0.0008931436,0.0006290711,0.0001112711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000584622,"about_ca_system_score_gemma":0.0001166163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005589815,"about_ca_topic_score_gemma":0.0005681381,"domain_scores_codex":[0.9982086,0.0005928111,0.0003691913,0.0003842434,0.0001444115,0.0003007219],"domain_scores_gemma":[0.9938305,0.001290683,0.00009679786,0.004656421,0.00008586742,0.00003975477],"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.00002751729,0.0003054175,0.0004364468,0.000004416855,0.00002958424,0.000001853359,0.000369339,0.00001045086,0.0001022688,0.9794129,0.009821077,0.009478743],"study_design_scores_gemma":[0.00064347,0.0001370351,0.01441634,0.00005304935,0.00002096521,0.000009110339,0.0002062802,0.005273012,0.0001805124,0.6139581,0.3648707,0.0002314459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06046059,0.003800356,0.7304972,0.1116619,0.002329396,0.001010841,0.00003408675,0.0004414977,0.08976407],"genre_scores_gemma":[0.9544747,0.0004852565,0.03871194,0.005948762,0.00003001322,0.0002724286,0.00003034787,0.000009083191,0.00003741018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8940142,"threshold_uncertainty_score":0.7068107,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03638623541572816,"score_gpt":0.3015311055873364,"score_spread":0.2651448701716082,"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."}}