{"id":"W1570515303","doi":"10.1007/3-540-39568-7_8","title":"Computing Logarithms in GF (2n)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Logarithm; Base (topology); Integer (computer science); Mathematics; Finite field; Discrete mathematics; Generator (circuit theory); Combinatorics; Element (criminal law); Binary logarithm; Field (mathematics); Iterated logarithm; Pure mathematics; Physics; Computer science; Mathematical analysis","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.002750276,0.0006074878,0.000627293,0.002298142,0.0002679842,0.0005314681,0.004393381,0.0004312193,0.00002432643],"category_scores_gemma":[0.00008449228,0.0005990009,0.0001994456,0.001683056,0.0008461919,0.000533881,0.001918183,0.00142771,0.00005128143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002808334,"about_ca_system_score_gemma":0.0003437516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003384267,"about_ca_topic_score_gemma":0.0002076761,"domain_scores_codex":[0.995362,0.00005936829,0.0007175353,0.001814951,0.0009877562,0.001058417],"domain_scores_gemma":[0.9969615,0.000910297,0.0002857597,0.001477141,0.0001631051,0.0002021645],"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.000007361904,0.00003706252,0.0002723478,0.00002502625,0.000006510874,0.0002629076,0.000854269,0.008859404,0.00002893089,0.1536404,0.000007176272,0.8359985],"study_design_scores_gemma":[0.000475945,0.0002183449,0.000786407,0.0007765051,0.000005765367,0.0001351269,3.952522e-7,0.3695692,0.0004741665,0.6237984,0.002638595,0.001121236],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002876373,0.0004518912,0.9837859,0.0002951516,0.00202474,0.0003007927,0.000001740124,0.0002399244,0.01261218],"genre_scores_gemma":[0.3523693,0.00003669977,0.6436237,0.003022241,0.0007212379,0.000003642125,0.000004219788,0.0000539799,0.0001650144],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8348773,"threshold_uncertainty_score":0.9996461,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02285873287463525,"score_gpt":0.2591494747443059,"score_spread":0.2362907418696707,"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."}}