{"id":"W2020427895","doi":"10.1016/j.jco.2004.01.002","title":"On the complexity of the discrete logarithm and Diffie–Hellman problems","year":2004,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discrete logarithm; Logarithm; Mathematics; Function (biology); Cryptography; Computational complexity theory; Discrete mathematics; Decision problem; Security parameter; Theoretical computer science; Computer science; Algorithm; Public-key cryptography; Encryption","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.0007368588,0.0001394447,0.0002646882,0.00006957798,0.000296737,0.0001071659,0.001428496,0.00004108186,0.00001625619],"category_scores_gemma":[0.0000861357,0.00006926189,0.0002053472,0.0003516703,0.001145789,0.0003020634,0.0004311622,0.0004507592,0.000001550111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000267243,"about_ca_system_score_gemma":0.00007000665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007683074,"about_ca_topic_score_gemma":0.0001428163,"domain_scores_codex":[0.9985258,0.0001763741,0.0004321351,0.0001592937,0.0005132236,0.0001931934],"domain_scores_gemma":[0.9984467,0.0001772183,0.0005173563,0.0006275059,0.0001386224,0.00009261172],"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.00002020653,0.0001403965,0.000578666,0.00001715518,0.00002884699,0.000003107801,0.0006436264,0.00004492232,0.0001362639,0.9977133,0.0003044168,0.0003690451],"study_design_scores_gemma":[0.0005403383,0.0002225888,0.08999164,0.00009498822,0.00001201881,0.00009220235,0.00004288659,0.0005638499,0.0007112431,0.9066818,0.0009601164,0.00008627495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7885252,0.0003195548,0.1881149,0.02093616,0.0004563319,0.0003013012,0.00005102657,0.00002241456,0.001273148],"genre_scores_gemma":[0.985998,0.00003031842,0.01345347,0.0004543272,0.00005639727,8.914648e-7,6.28094e-7,0.00000408907,0.000001910982],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1974728,"threshold_uncertainty_score":0.4221707,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05587024331900451,"score_gpt":0.2560173765409879,"score_spread":0.2001471332219834,"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."}}