Tristan Benoît – Approche multimodale pour la génération de noms de fonctions à partir du code binaire

Sciences 3- S3 351

La compréhension du code binaire est cruciale en rétro-ingénierie. Usuellement, des bases de fonctions servent à identifier dans un binaire les fonctions proches de références connues. Cependant, souvent les projections … Continue reading Tristan Benoît – Approche multimodale pour la génération de noms de fonctions à partir du code binaire

Mengce Zheng – Lattice-based solving strategy using Coppersmith’s techniques and its applications

Sciences 3- S3 351

Lattice-based cryptanalysis using Coppersmith's techniques has emerged as a powerful approach to compromising the security of several cryptographic algorithms under specific conditions. This talk will provide an exploration of the … Continue reading Mengce Zheng – Lattice-based solving strategy using Coppersmith’s techniques and its applications

Séminaire Algorithmique : « Commit graphs in Version-Control Systems: incremental reachability and label discovery », Euxane Tran-Girard (LIGM, Univ. Paris-Est G. Eiffel)

Sciences 3- S3 351

Current distributed source version-control systems (such as Git and Mercurial), track the history of changes using an append-only directed acyclic graph, sometimes complemented by labels subsequently attached to commits. We … Continue reading Séminaire Algorithmique : « Commit graphs in Version-Control Systems: incremental reachability and label discovery », Euxane Tran-Girard (LIGM, Univ. Paris-Est G. Eiffel)