{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004610271,0.0001747782,0.0001486913,0.0001996465,0.0004695929,0.0006768528,0.0003549472,0.00007617599,0.000002373501],"category_scores_gemma":[0.00001334492,0.0001237887,0.00008357874,0.0004341357,0.0000607364,0.002552856,0.00003651254,0.0001300068,0.00001232988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001892659,"about_ca_system_score_gemma":0.00004718143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003383893,"about_ca_topic_score_gemma":0.000005143271,"domain_scores_codex":[0.9987559,0.00006243934,0.0004187119,0.0002094778,0.0002899797,0.0002635435],"domain_scores_gemma":[0.9990867,0.0001619315,0.0002181983,0.000269123,0.0001648488,0.00009924711],"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.00001241994,0.00004794676,0.00003208712,0.00002115643,0.00001672977,5.54477e-7,0.002143344,0.004797051,0.00001188044,0.2505537,0.0004053879,0.7419578],"study_design_scores_gemma":[0.0006388427,0.0004608145,0.01184308,0.00001672662,0.00001556041,0.00001875879,0.0002314093,0.9304056,0.00002719378,0.05325678,0.002895661,0.0001896407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00483278,0.0001463723,0.992499,0.001207654,0.0003038608,0.0006539712,0.000009787507,0.0001906565,0.0001559356],"genre_scores_gemma":[0.9100833,0.00008790881,0.08830441,0.001290795,0.00007770766,0.00004817044,0.00009179841,0.00000661652,0.000009290922],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9256085,"threshold_uncertainty_score":0.6526907,"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."}}