{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003130487,0.0001417821,0.0001825361,0.0001718139,0.000260786,0.0003006768,0.0003775676,0.00004736479,0.0003667097],"category_scores_gemma":[0.00009343426,0.0001338746,0.0002005119,0.0009530301,0.00006908384,0.0001906962,0.00007431609,0.00006795471,0.000011415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002540827,"about_ca_system_score_gemma":0.0003306922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001534953,"about_ca_topic_score_gemma":0.0001717944,"domain_scores_codex":[0.9986305,0.00005445737,0.000291794,0.0004390285,0.0002365178,0.000347657],"domain_scores_gemma":[0.9988146,0.0002617252,0.00006637635,0.0004616771,0.0002921911,0.0001034264],"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.000006089967,0.000131947,0.0006759729,0.00003690373,0.00002784693,0.000008583735,0.0001924833,0.00004625776,0.0009754117,0.987409,0.003193361,0.007296174],"study_design_scores_gemma":[0.006258038,0.0006436828,0.004886664,0.0001060291,0.000111922,0.00005438975,0.000497934,0.4140348,0.02826041,0.4367114,0.1068347,0.001599968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01030113,0.00005438673,0.9813968,0.001961483,0.0001914852,0.0003899735,0.00006874442,0.0001996816,0.005436332],"genre_scores_gemma":[0.5333477,0.000001833421,0.4655666,0.0008059234,0.00003324867,0.0001213599,0.00006489394,0.00001102598,0.00004738815],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5506976,"threshold_uncertainty_score":0.5459248,"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."}}