{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003183753,0.000393851,0.000383131,0.0007239431,0.0003860863,0.0004198701,0.001746331,0.0001512106,0.00004603934],"category_scores_gemma":[0.00001622415,0.0003338988,0.0001332709,0.0007387513,0.0002582117,0.0003036334,0.000234557,0.0003504797,0.00002671056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001774296,"about_ca_system_score_gemma":0.000533435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002929896,"about_ca_topic_score_gemma":0.0001609524,"domain_scores_codex":[0.9968255,0.00002773326,0.0003757001,0.001290146,0.0009282547,0.0005526426],"domain_scores_gemma":[0.9975681,0.0006204688,0.0001437385,0.001270524,0.0002657023,0.0001315025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002562407,0.0001636079,0.00001347898,0.0001344317,0.00002976878,0.00000624382,0.001660657,0.1285358,0.0003544808,0.5000398,0.0001021457,0.368934],"study_design_scores_gemma":[0.0006476975,0.0008205709,0.0002157604,0.0002494008,0.00001422677,0.000006405988,5.081253e-7,0.8947721,0.001291584,0.100652,0.0008197307,0.0005100643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001211146,0.00001412377,0.9946252,0.001263034,0.000364569,0.002042894,0.0001123902,0.0001277061,0.0002390044],"genre_scores_gemma":[0.4782001,0.000001834964,0.5196417,0.001703213,0.0001341954,0.000165932,0.00009509369,0.00002948722,0.00002846071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7662362,"threshold_uncertainty_score":0.9999113,"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."}}