{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008008231,0.001387149,0.003087698,0.003308596,0.003376548,0.01019923,0.00371239,0.00354883,0.01014486],"category_scores_gemma":[0.05480824,0.001355312,0.001997692,0.0045881,0.008420973,0.0321498,0.006897189,0.01076734,0.000958112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007332383,"about_ca_system_score_gemma":0.003997321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002862284,"about_ca_topic_score_gemma":0.001808588,"domain_scores_codex":[0.9913211,0.00294643,0.0004410972,0.0008964174,0.003376353,0.001018454],"domain_scores_gemma":[0.9039366,0.08378069,0.003224745,0.00454902,0.002776245,0.001732708],"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.0002770753,0.0001254347,0.000938408,0.000166974,0.00004309013,0.0001025211,0.0003255449,0.01705505,0.0002440608,0.9618513,0.006955036,0.01191552],"study_design_scores_gemma":[0.0000398983,0.0000155035,0.0002679311,0.00002798848,0.00001418727,0.00006538527,0.0000660285,0.03696948,0.0001348819,0.9605187,0.001858973,0.00002117024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3398579,0.02279999,0.3197819,0.092516,0.002318318,0.0003398084,0.002368678,0.0004506872,0.2195668],"genre_scores_gemma":[0.9308529,0.007473502,0.03665642,0.001810766,0.003546727,0.0003386532,0.00121269,0.0002314268,0.0178769],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01019923,"threshold_uncertainty_score":0.05320042,"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."}}