{"id":"W3195953963","doi":"","title":"Finding discrete logarithms with a set orbit distinguisher.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","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":"Discrete logarithm; Logarithm; Binary logarithm; Mathematics; Time complexity; Discrete mathematics; Set (abstract data type); Prime (order theory); Combinatorics; Polynomial; Algorithm; Computer science; 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":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007435433,0.0007836557,0.0008876947,0.0005068961,0.0004628882,0.0004125513,0.003626805,0.0005718602,0.0001171999],"category_scores_gemma":[0.0002457412,0.0006721238,0.0004111516,0.0003701151,0.0009867323,0.0001737502,0.00607527,0.003716196,0.0001259625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004837582,"about_ca_system_score_gemma":0.0003093746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007412135,"about_ca_topic_score_gemma":0.0003277248,"domain_scores_codex":[0.9955677,0.0004976122,0.0005833367,0.001921069,0.0004206568,0.001009658],"domain_scores_gemma":[0.9955897,0.0008179992,0.000566253,0.002553622,0.0001373761,0.0003350736],"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.0001021483,0.00007599237,0.008162643,0.00009286041,0.0002341273,0.0003832928,0.003666777,0.0002758515,0.0002685731,0.980799,0.0002541097,0.005684648],"study_design_scores_gemma":[0.0005012786,0.0002051641,0.007248508,0.0002575226,0.00007286341,0.0002969065,0.00008142834,0.00558613,0.0004056453,0.9800091,0.00437458,0.0009608197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09228107,0.00005631886,0.8897069,0.001236938,0.001661012,0.0005562834,0.00007608869,0.0006385047,0.01378686],"genre_scores_gemma":[0.3745446,0.00001886536,0.6245363,0.0002601708,0.0003032494,0.0001941404,0.00007994324,0.0000544475,0.000008350223],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2822635,"threshold_uncertainty_score":0.999573,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01948788777850152,"score_gpt":0.2691911555552283,"score_spread":0.2497032677767268,"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."}}