{"id":"W2135205181","doi":"10.26421/qic3.4-3","title":"Shor's discrete logarithm quantum algorithm for elliptic curves","year":2003,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":327,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Post-quantum cryptography; Quantum algorithm; Quantum computer; Integer factorization; Qubit; Mathematics; Elliptic curve; Quantum Fourier transform; Schoof's algorithm; Elliptic curve cryptography; Discrete mathematics; Counting points on elliptic curves; Logarithm; Modulo; Algorithm; Cryptography; Quantum phase estimation algorithm; Quantum; Quantum error correction; Public-key cryptography; Computer science; Quantum mechanics; Pure mathematics; Encryption; Mathematical analysis; Physics","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.001756333,0.0006672938,0.001051849,0.000935356,0.001629663,0.002168209,0.00144819,0.001199726,0.007785625],"category_scores_gemma":[0.003717802,0.0004576934,0.0009670288,0.001312499,0.002102009,0.004624823,0.002657233,0.00186867,0.002660034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001009902,"about_ca_system_score_gemma":0.002005103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008055853,"about_ca_topic_score_gemma":0.0007752876,"domain_scores_codex":[0.9978368,0.0004679883,0.0001450341,0.00023135,0.0009881522,0.0003307728],"domain_scores_gemma":[0.9991366,0.0002672087,0.00004456141,0.000335942,0.0001675255,0.00004814765],"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.0001285918,0.00005885333,0.0001862091,0.0001278773,0.00002024002,0.0001108831,0.0002157632,0.02322846,0.003285984,0.8972077,0.005960744,0.0694686],"study_design_scores_gemma":[0.000119462,0.0001010312,0.00009563938,0.00005570329,0.00001886665,0.0001394769,0.00007637022,0.1253061,0.01137048,0.8323405,0.03031977,0.00005653949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02140043,0.0006199974,0.9443083,0.001533567,0.000401834,0.0002401589,0.0001606166,0.001333887,0.03000113],"genre_scores_gemma":[0.3344362,0.001108433,0.6472998,0.0004065965,0.0002224725,0.000363233,0.0003666671,0.0003727319,0.01542381],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007785625,"threshold_uncertainty_score":0.0260455,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01243195162450697,"score_gpt":0.2534901271177673,"score_spread":0.2410581754932603,"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."}}