NOS ÉVÉNEMENTS
Séminaire Algorithmique : Nicolas Bitar (LAMFA, Univ. Picardie), « Subshifts of finite type and quasi-isometries beyond groups »
In 1964, R. Berger proved the existence of strongly aperiodic subshifts of finite type (SFT) on $\mathbb{Z}^2$, and used them to prove the undecidability of the Domino Problem. With the … Continue reading Séminaire Algorithmique : Nicolas Bitar (LAMFA, Univ. Picardie), « Subshifts of finite type and quasi-isometries beyond groups »
29 avril / 10:45 - 11:45Tristan Benoît – Approche multimodale pour la génération de noms de fonctions à partir du code binaire
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
29 avril / 14:00 - 15:00Mengce Zheng – Lattice-based solving strategy using Coppersmith’s techniques and its applications
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
30 avril / 14:00 - 15:00Victor Mollimard – Partial Sums Meet FFT: Improved Attack on 6-roued AES
The partial sums cryptanalytic technique was introduced in 2000 by Ferguson et al., who used it to break 6-round AES with time complexity of $2^{52}$ S-box computations — a record … Continue reading Victor Mollimard – Partial Sums Meet FFT: Improved Attack on 6-roued AES
5 mai / 14:00 - 15:00
LES NOUVELLES DU GREYC
Séminaire Algorithmique : Nicolas Bitar (LAMFA, Univ. Picardie), « Subshifts of finite type and quasi-isometries beyond groups »
In 1964, R. Berger proved the existence of strongly aperiodic subshifts of finite type (SFT) on $\mathbb{Z}^2$, and used them to prove the undecidability of the Domino Problem. With the … Continue reading Séminaire Algorithmique : Nicolas Bitar (LAMFA, Univ. Picardie), « Subshifts of finite type and quasi-isometries beyond groups »
29 avril / 10:45 - 11:45Tristan Benoît – Approche multimodale pour la génération de noms de fonctions à partir du code binaire
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
29 avril / 14:00 - 15:00Mengce Zheng – Lattice-based solving strategy using Coppersmith’s techniques and its applications
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
30 avril / 14:00 - 15:00Victor Mollimard – Partial Sums Meet FFT: Improved Attack on 6-roued AES
The partial sums cryptanalytic technique was introduced in 2000 by Ferguson et al., who used it to break 6-round AES with time complexity of $2^{52}$ S-box computations — a record … Continue reading Victor Mollimard – Partial Sums Meet FFT: Improved Attack on 6-roued AES
5 mai / 14:00 - 15:00
