{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009309062,0.0007985089,0.001261492,0.0007696754,0.001747889,0.002470957,0.0008772723,0.001267696,0.01144829],"category_scores_gemma":[0.004252923,0.0003798588,0.001057594,0.001276487,0.001543524,0.003131366,0.003069496,0.002810027,0.00357532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001500828,"about_ca_system_score_gemma":0.002436285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001127837,"about_ca_topic_score_gemma":0.00121052,"domain_scores_codex":[0.9981446,0.0003606254,0.00008513362,0.0002920361,0.0007563936,0.0003611847],"domain_scores_gemma":[0.9985541,0.0006464125,0.00008580795,0.0004211288,0.0001796718,0.000112936],"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.00181317,0.0005687059,0.003979887,0.0008690796,0.0001909251,0.002051401,0.001464411,0.1320842,0.02404321,0.5198639,0.04647841,0.2665927],"study_design_scores_gemma":[0.000358846,0.0003814299,0.0008584763,0.0001112376,0.00008144149,0.0009995764,0.0006522326,0.2521105,0.03007469,0.6815773,0.03269881,0.00009545841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4557613,0.0008689115,0.4269129,0.006600985,0.000628505,0.0004641497,0.001208392,0.003897281,0.1036575],"genre_scores_gemma":[0.8789586,0.0002717378,0.1021528,0.0003569082,0.0001980924,0.0001143179,0.0006358695,0.0003936239,0.01691795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01144829,"threshold_uncertainty_score":0.03829837,"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."}}