{"id":"W2064998746","doi":"10.1515/jmc-2012-0002","title":"Finding discrete logarithms with a set orbit distinguisher","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Logarithm; Orbit (dynamics); Set (abstract data type); Discrete logarithm; Mathematics; Arithmetic; Computer science; Mathematical analysis; Computer security; Programming language; Public-key cryptography","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.001094888,0.0001506103,0.0003842618,0.0001625897,0.00009456664,0.00007232847,0.0006563893,0.00008255651,0.00007780689],"category_scores_gemma":[0.0003391745,0.00009449262,0.0001414028,0.0002896103,0.00008975787,0.0004525917,0.0001442537,0.0003345122,0.00004187378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002161825,"about_ca_system_score_gemma":0.00003467471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.913178e-7,"about_ca_topic_score_gemma":3.110534e-7,"domain_scores_codex":[0.9985757,0.0001545005,0.000434283,0.0001232814,0.000293762,0.0004184933],"domain_scores_gemma":[0.998642,0.0003857128,0.0003499869,0.0002852169,0.0001083951,0.0002286443],"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.00005106285,0.0001563535,0.004324383,0.0000463069,0.00008136356,0.0000848954,0.001539943,0.000004535446,0.0001041821,0.9914035,0.000699827,0.001503606],"study_design_scores_gemma":[0.001461674,0.001379716,0.004233176,0.0003521354,0.0001611765,0.01018944,0.0008102332,0.001435651,0.0007647394,0.9729682,0.005676913,0.000566905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1014103,0.0001131625,0.8921571,0.001235552,0.0003341786,0.0000576136,6.417499e-7,0.00003766132,0.004653807],"genre_scores_gemma":[0.8235387,0.000001849514,0.1760779,0.0001419546,0.0002054243,0.000002109285,1.654392e-7,0.000009093455,0.00002279633],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7221284,"threshold_uncertainty_score":0.3853297,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02869037447552344,"score_gpt":0.2826695385318816,"score_spread":0.2539791640563581,"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."}}