{"id":"W2950732706","doi":"10.48550/arxiv.quant-ph/0301141","title":"Shor's discrete logarithm quantum algorithm for elliptic curves","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Post-quantum cryptography; Quantum computer; Quantum algorithm; Integer factorization; Qubit; Elliptic curve; Schoof's algorithm; Mathematics; Counting points on elliptic curves; Elliptic curve cryptography; Quantum Fourier transform; Algorithm; Modulo; Logarithm; Cryptography; Discrete mathematics; Quantum; Quantum error correction; Public-key cryptography; Computer science; Pure mathematics; Quantum mechanics; Encryption; Physics; Mathematical analysis; Quarter period","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"],"consensus_categories":[],"category_scores_codex":[0.000912836,0.0008537356,0.0009423675,0.0002361561,0.000412896,0.0003471907,0.002868918,0.0004672436,0.00001831843],"category_scores_gemma":[0.0001641309,0.0007685958,0.0006330748,0.00041015,0.0001718244,0.0002006814,0.002081072,0.001420363,0.00009483265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009671525,"about_ca_system_score_gemma":0.0003516885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006174276,"about_ca_topic_score_gemma":0.000004586252,"domain_scores_codex":[0.9952424,0.0002443661,0.0008717909,0.001941049,0.0005807031,0.001119736],"domain_scores_gemma":[0.9963596,0.0003760881,0.0005099081,0.002164292,0.0002679449,0.0003221697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004572455,0.001630169,0.01474275,0.006571555,0.002112049,0.0007671423,0.003373199,0.03197761,0.0005851736,0.03017662,0.06421339,0.8438046],"study_design_scores_gemma":[0.0004852507,0.0002226738,0.00307489,0.001025209,0.00008435248,0.00006635262,0.000012427,0.9608316,0.0004212417,0.01273052,0.0198089,0.001236549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03323218,0.00521064,0.9516059,0.002987237,0.004852137,0.001121588,0.0001083888,0.0006483285,0.0002336684],"genre_scores_gemma":[0.1336403,0.002012289,0.8521504,0.00548795,0.002886169,0.000608986,0.0003736789,0.0003271102,0.002513149],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.928854,"threshold_uncertainty_score":0.9994765,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03074811071316665,"score_gpt":0.2751321825180328,"score_spread":0.2443840718048662,"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."}}