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.
Practical infos
Next sessions
-
Opening Pandora's Box: White-Box Attacks on Microsoft's PhotoDNA Perceptual Hash Function
Speaker : Diane Leblanc-Albarel - KU Leuven
PhotoDNA is a widely deployed perceptual hash function used for the detection of illicit content such as Child Sexual Abuse Material (CSAM). In this talk, I will present our paper introducing the first mathematical description of Alleged PhotoDNA, a function that reproduces the outputs of PhotoDNA. Our analysis reveals several structural weaknesses: the function is piece-wise linear and[…]-
Cryptography
-
Privacy
-
-
Towards More Secure Large Language Models
Speaker : Raouf Kerkouche - Inria Lille
Large Language Models (LLMs) have achieved considerable success and are now widely used across multiple domains, highlighting their transformative impact on both technology and society. However, this widespread adoption also exposes LLMs to numerous security threats that can alter model behavior or degrade overall performance. To mitigate these threats, most research has focused on alignment[…]-
Machine learning
-