{"id":"W2071302523","doi":"10.1007/s00200-005-0187-7","title":"On the low hamming weight discrete logarithm problem for nonadjacent representations","year":2005,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discrete logarithm; Logarithm; Mathematics; Elliptic curve cryptography; Cryptography; Cryptosystem; Elliptic curve; Post-quantum cryptography; Hyperelliptic curve cryptography; Discrete mathematics; Algorithm; Computer science; Public-key cryptography; Pure mathematics; Encryption","routes":{"ca_aff":true,"ca_fund":true,"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.0004668995,0.0001283322,0.0001244231,0.0001171971,0.0003283682,0.0001563811,0.000722138,0.00004391987,0.000001950488],"category_scores_gemma":[0.00003367764,0.0001053002,0.00004920473,0.0004158936,0.00003926691,0.0001508724,0.0003103708,0.0002320419,0.000003449736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002966627,"about_ca_system_score_gemma":0.000012487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002837758,"about_ca_topic_score_gemma":0.00001256231,"domain_scores_codex":[0.9990695,0.0000422164,0.0002585723,0.0002644082,0.0001162404,0.0002490982],"domain_scores_gemma":[0.9981469,0.0009741769,0.00007096586,0.0007249388,0.00003363124,0.00004937794],"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.000003175179,0.00006999206,0.0001899969,0.00003580378,0.00001856506,3.7509e-7,0.0009011872,0.07698949,0.0003717165,0.8741733,0.0001795304,0.0470669],"study_design_scores_gemma":[0.0003562705,0.00001962516,0.001515808,0.0001163657,0.000004205134,0.000005694395,0.00005527321,0.9835761,0.00114788,0.008589569,0.004445841,0.0001673692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03222356,0.0005136046,0.959448,0.006444373,0.00003394019,0.0005762713,9.770645e-7,0.0001472788,0.0006119534],"genre_scores_gemma":[0.8236972,0.00007652167,0.1757817,0.000266976,0.00002972142,0.0001189091,0.000004859016,0.00001051781,0.00001353971],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9065866,"threshold_uncertainty_score":0.4294016,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006295475143209721,"score_gpt":0.2229101934455309,"score_spread":0.2166147183023212,"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."}}