{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004458039,0.0001555485,0.000162517,0.0002231997,0.0002759581,0.0002858561,0.000180647,0.00006692736,0.000004515508],"category_scores_gemma":[0.00005468096,0.0001394497,0.00008046361,0.0003913559,0.00005635751,0.001741524,0.00003553711,0.00009263041,0.00002299198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000159693,"about_ca_system_score_gemma":0.00005379566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001031108,"about_ca_topic_score_gemma":0.000001066365,"domain_scores_codex":[0.9988285,0.00006719334,0.0004445403,0.0001823647,0.0002380318,0.0002393332],"domain_scores_gemma":[0.9992293,0.0001449656,0.0001857742,0.0001681739,0.0001756353,0.0000962011],"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.000005028072,0.00003987625,0.00004408344,0.000200665,0.00002761104,9.00162e-7,0.0008596792,0.001196929,0.000008870349,0.7240327,0.001525495,0.2720582],"study_design_scores_gemma":[0.0005606254,0.0001559291,0.0005655373,0.00006024872,0.00001336901,0.00003128211,0.000162628,0.9477159,0.0001029602,0.03899558,0.01142491,0.0002109877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001703009,0.0006276761,0.995652,0.0005734826,0.000423187,0.000421563,0.00001010527,0.000154276,0.0004347098],"genre_scores_gemma":[0.6847903,0.0008652827,0.3118315,0.002107678,0.00005366497,0.0001201442,0.0001866699,0.0000151861,0.00002958138],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.946519,"threshold_uncertainty_score":0.5686593,"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."}}