{"id":"W3203177029","doi":"10.5753/sbseg.2021.17313","title":"Towards constant-time probabilistic root finding for code-based cryptography","year":2021,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Probabilistic logic; Computer science; Cryptography; McEliece cryptosystem; Cryptosystem; Timing attack; Algorithm; Probabilistic analysis of algorithms; Deterministic algorithm; Code (set theory); Theoretical computer science; Root (linguistics); Side channel attack; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00283737,0.001069537,0.001032678,0.001654133,0.0009052205,0.002557376,0.001982141,0.001613417,0.00342353],"category_scores_gemma":[0.01698735,0.0005483969,0.0008619526,0.002128571,0.002373005,0.004696121,0.002687391,0.004174639,0.002310858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001330317,"about_ca_system_score_gemma":0.002440008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007459359,"about_ca_topic_score_gemma":0.0005646104,"domain_scores_codex":[0.9959125,0.0008962621,0.0001951935,0.0005769675,0.002070392,0.0003486351],"domain_scores_gemma":[0.9909083,0.003962612,0.0008997003,0.002455251,0.001555449,0.0002187548],"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.0008824672,0.0002374415,0.001010536,0.0004669411,0.00007425292,0.0002117053,0.0003787388,0.1265989,0.05515681,0.4734762,0.00650945,0.3349964],"study_design_scores_gemma":[0.0001415166,0.0002238971,0.0002118877,0.0001072253,0.00003674526,0.0005286029,0.00005859423,0.7394133,0.0378933,0.2085957,0.01271091,0.00007824834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008295138,0.000345295,0.988493,0.0002484668,0.00007198347,0.00004757981,0.00001693534,0.0007360276,0.001745496],"genre_scores_gemma":[0.2282484,0.0005768138,0.7673804,0.0002372044,0.0001983933,0.000126858,0.00008836486,0.0002984653,0.002845115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00342353,"threshold_uncertainty_score":0.01500565,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03147530968396393,"score_gpt":0.297102111994265,"score_spread":0.2656268023103011,"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."}}