{"id":"W2947149071","doi":"10.1007/978-3-030-23696-0_14","title":"On MILP-Based Automatic Search for Differential Trails Through Modular Additions with Application to Bel-T","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Computer science; Modular design; Differential (mechanical device); Algorithm; Integer (computer science); Cipher; Lookup table; Parallel computing; Arithmetic; Mathematics; Cryptography; Encryption; Programming language; Computer network","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.000855409,0.001044584,0.001232039,0.001493558,0.0008908359,0.001871233,0.001522843,0.0008969944,0.01434234],"category_scores_gemma":[0.003362093,0.0005117598,0.001005879,0.001486182,0.001223431,0.002322179,0.002470895,0.001725973,0.003814389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006147057,"about_ca_system_score_gemma":0.0008171838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009811064,"about_ca_topic_score_gemma":0.001406929,"domain_scores_codex":[0.9992786,0.0001557476,0.00005517598,0.0001164424,0.0003030696,0.00009107389],"domain_scores_gemma":[0.9989467,0.0005575971,0.0000571757,0.0002081374,0.0001863223,0.00004400215],"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.0004712931,0.0002273469,0.0004243288,0.0004015598,0.00006362675,0.0002476119,0.0002326609,0.1082473,0.0202444,0.2575859,0.01263242,0.5992215],"study_design_scores_gemma":[0.00004342929,0.0001060731,0.000101359,0.00005034054,0.00002171942,0.0001601071,0.00005195595,0.8350804,0.01082087,0.1461377,0.007390426,0.00003554788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007403745,0.0001451929,0.9824997,0.00007320476,0.0001063803,0.00006610182,0.00006832915,0.001843212,0.007794212],"genre_scores_gemma":[0.1586734,0.0002115983,0.8301545,0.0001414597,0.00008705354,0.0001276561,0.0003573023,0.0005895348,0.009657471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01434234,"threshold_uncertainty_score":0.04797989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01989023891447446,"score_gpt":0.2835753954137794,"score_spread":0.263685156499305,"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."}}