{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003149045,0.0005964093,0.001252465,0.001280977,0.001684212,0.003481387,0.001414313,0.001672452,0.003181121],"category_scores_gemma":[0.0164193,0.0005175119,0.001255489,0.00137071,0.003547016,0.008118924,0.004667417,0.00404815,0.0006655866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002449329,"about_ca_system_score_gemma":0.002027747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005397036,"about_ca_topic_score_gemma":0.0004852416,"domain_scores_codex":[0.9972166,0.000455432,0.00024084,0.0006880724,0.001007044,0.0003920159],"domain_scores_gemma":[0.9741976,0.01866555,0.001672338,0.003701332,0.0008433256,0.0009197911],"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.003949527,0.0007811175,0.01558961,0.0005900437,0.0002899123,0.0007069097,0.00173836,0.1458137,0.05360271,0.6160353,0.005211539,0.1556913],"study_design_scores_gemma":[0.0002659921,0.0005292186,0.001110065,0.00006760722,0.0001228445,0.0004518376,0.0002249629,0.440871,0.05811724,0.4938285,0.004310601,0.0001000574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4536276,0.0004089636,0.5330371,0.002122559,0.0001192449,0.0001627246,0.0002577051,0.00126665,0.008997411],"genre_scores_gemma":[0.8490161,0.000123741,0.1474858,0.000173778,0.0000768473,0.00007971804,0.0002055182,0.00008816749,0.002750433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003481387,"threshold_uncertainty_score":0.01777124,"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."}}