{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003036254,0.000753672,0.001257869,0.001512911,0.001768604,0.003836319,0.001900672,0.001996088,0.004593833],"category_scores_gemma":[0.0156549,0.0005586589,0.00150675,0.001934684,0.003558684,0.009834898,0.005505521,0.004367312,0.001308544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002671462,"about_ca_system_score_gemma":0.002140712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007003236,"about_ca_topic_score_gemma":0.0006245985,"domain_scores_codex":[0.9965839,0.0005226404,0.0002531907,0.0008397124,0.001257661,0.0005429267],"domain_scores_gemma":[0.9814619,0.01299723,0.001290971,0.003100397,0.0005654978,0.0005839797],"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.00231534,0.0005432886,0.006604597,0.0006619203,0.0001863499,0.0004874424,0.001301666,0.07083261,0.02995571,0.6729501,0.008950314,0.2052107],"study_design_scores_gemma":[0.0001928985,0.0003664807,0.0006885778,0.00006324623,0.00008992497,0.0005385567,0.0002074073,0.236466,0.0384314,0.7147709,0.008117493,0.0000670901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1729424,0.0008253067,0.8038935,0.002770265,0.0001766304,0.0002354047,0.0005289489,0.002140617,0.01648695],"genre_scores_gemma":[0.6593996,0.0003984288,0.3310516,0.0003631712,0.0001636211,0.0001907796,0.0006665531,0.00021361,0.007552576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004593833,"threshold_uncertainty_score":0.01938295,"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."}}