{"id":"W2577487606","doi":"","title":"Faster individual discrete logarithms in non-prime finite fields with the NFS and FFS algorithms","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of Calgary","funders":"","keywords":"Finite field; Discrete logarithm; Mathematics; Algorithm; Logarithm; Polynomial; Exponent; Field (mathematics); Discrete mathematics; Computer science; Pure mathematics; Mathematical analysis; Encryption","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.0006035341,0.0006077202,0.000704393,0.0005414972,0.0002351108,0.0002656544,0.002342411,0.0004785904,0.0000220892],"category_scores_gemma":[0.00005280334,0.0003542631,0.000203931,0.0002840074,0.001190096,0.0001791927,0.005505325,0.001917648,0.00003671855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002633225,"about_ca_system_score_gemma":0.0001850909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001266239,"about_ca_topic_score_gemma":0.0005678638,"domain_scores_codex":[0.9963526,0.0004873062,0.0005057689,0.001413904,0.0004107921,0.0008296439],"domain_scores_gemma":[0.9965315,0.001331992,0.0003227954,0.0015566,0.00006653178,0.0001905557],"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.0003213696,0.0003833235,0.06740982,0.0002614139,0.001337757,0.001408142,0.04057678,0.001475309,0.0002224151,0.7207376,0.0007762751,0.1650898],"study_design_scores_gemma":[0.001722712,0.0003555598,0.2076962,0.0004367701,0.00008642192,0.0002148983,0.0002536288,0.01108374,0.0003175693,0.7760101,0.0008324607,0.0009899936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04704252,0.0002580514,0.9396839,0.009612476,0.0005212809,0.0007761522,0.0000682176,0.00009476156,0.001942693],"genre_scores_gemma":[0.6931164,0.0002441679,0.3050064,0.0009878713,0.0002324971,0.0003240758,0.00002874745,0.00004579622,0.00001410705],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6460739,"threshold_uncertainty_score":0.9998909,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01075818428019135,"score_gpt":0.2394017570258224,"score_spread":0.228643572745631,"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."}}