{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001527065,0.0006269615,0.000983782,0.0008574353,0.0016095,0.002186967,0.001443983,0.001203761,0.007813342],"category_scores_gemma":[0.003372565,0.0004453748,0.0009417811,0.001262352,0.002095739,0.004388164,0.002706614,0.001963213,0.002457903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001096946,"about_ca_system_score_gemma":0.001965188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009545416,"about_ca_topic_score_gemma":0.0008711116,"domain_scores_codex":[0.9979113,0.0004328982,0.0001306688,0.0002494938,0.0009303183,0.0003454642],"domain_scores_gemma":[0.9992157,0.0002321531,0.00003876732,0.000319767,0.0001477346,0.00004586397],"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.0001135119,0.00005743953,0.0001927481,0.0001065473,0.00001911343,0.00009665474,0.0002067901,0.02402203,0.00312658,0.9082629,0.006074796,0.0577208],"study_design_scores_gemma":[0.00009996291,0.00008152614,0.00009745879,0.00004618372,0.00001609214,0.0001161706,0.00007307245,0.1305651,0.01061369,0.8303856,0.02785647,0.0000486463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02517503,0.0005833833,0.9343975,0.001820824,0.0004047118,0.0002369816,0.0001969325,0.001478533,0.03570614],"genre_scores_gemma":[0.390632,0.0009842332,0.5894631,0.0004569505,0.0002115859,0.0003739941,0.0004043679,0.0003845723,0.01708925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007813342,"threshold_uncertainty_score":0.02613819,"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."}}