{"id":"W2399232315","doi":"10.1007/978-3-319-69453-5_30","title":"Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of Calgary","funders":"","keywords":"Discrete logarithm; Finite field; Embedding; Pairing; Reduction (mathematics); Degree (music); Mathematics; Field (mathematics); Computation; Computer science; Cryptography; Theoretical computer science; Logarithm; Position (finance); Discrete mathematics; Algorithm; Pure mathematics; Public-key cryptography; Artificial intelligence; Encryption; Mathematical analysis; Physics; Geometry; Computer security; Quantum mechanics","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","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001904494,0.0006147263,0.0005582066,0.000731872,0.0009510773,0.003004637,0.007198549,0.0003861535,0.000004902626],"category_scores_gemma":[0.0003124268,0.0005671033,0.0002312268,0.0009510305,0.0008710301,0.00137136,0.006788014,0.001893529,0.00001529698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002803726,"about_ca_system_score_gemma":0.000440018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004332938,"about_ca_topic_score_gemma":0.0001030478,"domain_scores_codex":[0.9944211,0.0001706649,0.0005267705,0.002715991,0.001170541,0.000994991],"domain_scores_gemma":[0.9950661,0.0002927303,0.0005112457,0.003691664,0.0001841244,0.0002541191],"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.00002973864,0.0003057589,0.001740191,0.0001900007,0.00003795083,0.0001104471,0.005095453,0.08615234,0.001908523,0.005258464,0.0005617496,0.8986094],"study_design_scores_gemma":[0.0003559644,0.0002106583,0.002048893,0.0009515244,0.000009780474,0.00006456725,0.000001079968,0.8493553,0.01104587,0.1344497,0.0004241347,0.001082503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01285747,0.000482124,0.9780603,0.001952425,0.005776763,0.000457566,0.00003907292,0.0003065587,0.00006769855],"genre_scores_gemma":[0.7271237,0.00005865892,0.2719574,0.0003154711,0.0004777675,0.00002637381,0.00002399024,0.00001595479,6.210109e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8975269,"threshold_uncertainty_score":0.999678,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0196497490266571,"score_gpt":0.2769593807766951,"score_spread":0.257309631750038,"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."}}