Description
Modelizing a problem using linear constraints and solving it by some Mixed Integer Linear Programming (MILP) solver is a popular approach in many domains of computer science. In this talk we present and compare different new techniques to modelize any subset of {0,1}^n for MILP. We then discuss the efficiency of our models by applying them to the search of differential paths, a classical problem in symmetric cryptography.
Infos pratiques
Prochains exposés
-
What you never wanted to know about vulnerability databases
Orateur : Henrik Plate - Endor Labs
Vulnerability databases play a crucial role in modern software security, serving as the backbone for Application Security (AppSec) and Software Composition Analysis (SCA) tools. However, the accuracy and reliability of these databases vary significantly, often leading to misinformed security decisions. This talk explores the challenges associated with vulnerability databases, including incomplete[…]-
Risk Assessment
-
SoSysec
-
Vulnerability management
-
-
CHERIoT RTOS: An OS for Fine-Grained Memory-Safe Compartments on Low-Cost Embedded Devices
Orateur : Hugo Lefeuvre - The University of British Columbia
Embedded systems do not benefit from strong memory protection, because they are designed to minimize cost. At the same time, there is increasing pressure to connect embedded devices to the internet, where their vulnerable nature makes them routinely subject to compromise. This fundamental tension leads to the current status-quo where exploitable devices put individuals and critical infrastructure[…]-
SoSysec
-
Compartmentalization
-
Operating system and virtualization
-
Hardware/software co-design
-
Hardware architecture
-