{"id":"W1596459745","doi":"10.1023/a:1016521712726","title":"A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Coprime integers; Mathematics; Logarithm; Discrete logarithm; Heuristic; Calculus (dental); Saddle point; Discrete mathematics; Computer science; Mathematical analysis; Mathematical optimization","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.003775438,0.001678985,0.001798866,0.002510673,0.002776525,0.005691874,0.003298717,0.003385168,0.01574495],"category_scores_gemma":[0.02144034,0.001130089,0.00203438,0.003373129,0.005971969,0.01284348,0.007235948,0.01061959,0.005219712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003527202,"about_ca_system_score_gemma":0.004784574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002886879,"about_ca_topic_score_gemma":0.002581998,"domain_scores_codex":[0.9953353,0.001134025,0.0001941104,0.0005912855,0.002285784,0.0004595826],"domain_scores_gemma":[0.9928176,0.004071917,0.0003230323,0.001263451,0.00123408,0.0002899885],"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.00003204702,0.00004022773,0.00006755353,0.00006779711,0.00001353955,0.00003392347,0.00008031342,0.002754714,0.0005320183,0.9742584,0.007194202,0.01492535],"study_design_scores_gemma":[0.00003300135,0.00001499786,0.00004465269,0.00003988497,0.000008278119,0.00003588078,0.00001829231,0.0172303,0.000688366,0.9726575,0.009207433,0.00002152844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01037138,0.001946599,0.8819499,0.009268693,0.001405307,0.0001859635,0.0005091074,0.0007148635,0.09364823],"genre_scores_gemma":[0.3934761,0.006048016,0.5059726,0.007050229,0.00384509,0.001106551,0.001246944,0.001231205,0.08002337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01574495,"threshold_uncertainty_score":0.05267215,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02257684429155489,"score_gpt":0.2215719582243225,"score_spread":0.1989951139327677,"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."}}