{"id":"W1797017151","doi":"10.5555/2011814.2011818","title":"An O(m 2 )-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2 m ) a","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Mathematics; Elliptic curve point multiplication; Elliptic curve; Discrete logarithm; Logarithm; Quantum algorithm; Homogeneous coordinates; Algorithm; Quantum; Polynomial; Discrete mathematics; Quantum computer; Post-quantum cryptography; Tripling-oriented Doche–Icart–Kohel curve; Schoof's algorithm; Mathematical analysis; Pure mathematics; Computer science; Public-key cryptography; Physics; Quantum mechanics; 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.0004527923,0.0005881826,0.0005850443,0.0003791214,0.0008641783,0.001322163,0.001355361,0.001031271,0.008579785],"category_scores_gemma":[0.001462036,0.0004080746,0.0005763697,0.0005111719,0.0007268626,0.0032946,0.001376683,0.0009719581,0.001341714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001129057,"about_ca_system_score_gemma":0.001837235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001542731,"about_ca_topic_score_gemma":0.003277811,"domain_scores_codex":[0.999495,0.0001017252,0.00002847205,0.0001217306,0.0001624839,0.00009052903],"domain_scores_gemma":[0.9996719,0.0001434959,0.00003154646,0.00009024738,0.0000359703,0.00002680612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008801888,0.0007268347,0.001614829,0.0007884161,0.0001475826,0.0004018452,0.0004998972,0.1016099,0.08029488,0.3711676,0.01771576,0.4241521],"study_design_scores_gemma":[0.0005500676,0.0003833365,0.0004681475,0.00007844591,0.00007546839,0.0003056629,0.0001647778,0.7847406,0.02977312,0.1685852,0.01479448,0.00008074455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09133702,0.0004637609,0.8883896,0.001175142,0.0001081678,0.0002287212,0.0001273562,0.002131792,0.01603842],"genre_scores_gemma":[0.3656645,0.0003785614,0.626445,0.0002207672,0.0000684669,0.0002252995,0.0002133904,0.0001256547,0.006658414],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008579785,"threshold_uncertainty_score":0.02870226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01134996137154901,"score_gpt":0.2686537118789915,"score_spread":0.2573037505074424,"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."}}