{"id":"W3036855880","doi":"10.1515/jmc-2015-0057","title":"A subexponential-time, polynomial quantum space algorithm for inverting the CM group action","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Canada First Research Excellence Fund; Public Works and Government Services Canada; Royal Bank of Canada","keywords":"Isogeny; Mathematics; Polynomial; Group (periodic table); Quantum algorithm; Action (physics); Quantum computer; Time complexity; Quantum; Cryptosystem; Multiplication (music); Group action; Discrete mathematics; Space (punctuation); Algorithm; Algebra over a field; Elliptic curve; Combinatorics; Pure mathematics; Computer science; Cryptography; Mathematical analysis; Quantum mechanics; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.0007159672,0.0001483666,0.0004086191,0.0001063837,0.0001753061,0.0001047861,0.0008045471,0.0001150173,0.00002260371],"category_scores_gemma":[0.0004685456,0.00009245505,0.0003431157,0.0003134196,0.00008869114,0.0002802904,0.0001485685,0.0003434025,0.00003457627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001819993,"about_ca_system_score_gemma":0.00005968587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001517783,"about_ca_topic_score_gemma":4.698424e-7,"domain_scores_codex":[0.9983988,0.0001863809,0.0006243945,0.0001884208,0.0002932679,0.0003087213],"domain_scores_gemma":[0.9983495,0.000659083,0.0004689828,0.0002062345,0.0001362119,0.0001799294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004654933,0.0008518602,0.0000709651,0.0003746203,0.0006390869,0.0001990093,0.005181497,0.00007742339,0.06187906,0.6981997,0.0389061,0.1931551],"study_design_scores_gemma":[0.002310275,0.002130808,0.0001919802,0.00008840224,0.0001843273,0.001538593,0.0008645093,0.7086035,0.004739522,0.2712803,0.007703596,0.0003641908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01452959,0.0001341909,0.958973,0.02562146,0.0004120227,0.0002256225,0.000001220258,0.00003459966,0.00006828873],"genre_scores_gemma":[0.2297639,0.00002901679,0.7677798,0.001336054,0.001037949,0.00002140889,7.041799e-7,0.00002305578,0.000008102636],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7085261,"threshold_uncertainty_score":0.3770207,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03095288594065633,"score_gpt":0.2680828124425766,"score_spread":0.2371299265019203,"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."}}