Abderrahmane Nitaj – The last decade of the RSA cryptosystem
Sciences 3- S3 351NIST recently released a publication related to the transition to Post-Quantum Cryptography which specifies that most of the public key classical cryptosystems, especially RSA will be officially deprecated by 2030 and banned after 2035. In this talk, I will review the limits of the main cryptanalytical attacks on RSA, and present two new variants of … Continue reading Abderrahmane Nitaj – The last decade of the RSA cryptosystem
Séminaire Image : « Mathematical foundations of a level-set-based shape convex hull identification algorithm », Carole Le Guyader
ENSICAEN - Batiment F - Salle F-200 6 Bd Maréchal Juin , CaenNous aurons le plaisir d'écouter Carole Le Guyader, Laboratoire LMI, INSA Rouen. Elle donnera un séminaire IMAGE le jeudi 6 février 2025 à 14h15 en salle de séminaire F-200. Titre : "Mathematical foundations of a level-set-based shape convex hull identification algorithm" Résumé : In this work, we introduce a proper mathematical framework to analyse a … Continue reading Séminaire Image : « Mathematical foundations of a level-set-based shape convex hull identification algorithm », Carole Le Guyader
Séminaire Algorithmique : « Enumeration Classes Defined by Circuits », Arnaud Durand (IMJ, Univ. Paris-Diderot)
Sciences 3- S3 351Enumerating is the task of generating all solutions associated with an instance of a computational problem. We refine the complexity landscape for enumeration problems by introducing very low classes defined by using Boolean circuits as enumerators. We locate well-known enumeration problems, e.g., from graph theory, Gray code enumeration, and propositional satisfiability in our classes. In … Continue reading Séminaire Algorithmique : « Enumeration Classes Defined by Circuits », Arnaud Durand (IMJ, Univ. Paris-Diderot)
Pascal Marchand – A la recherche des signes complotistes en ligne: exploration et expérimentation par la textométrie.
Sciences 3- S3 351On se situera à l’intersection des sciences de données et des sciences cognitives pour qualifier formellement les rhétoriques et représentations mobilisées dans les commentaires en ligne sur la vaccination. Le corpus (135 620 textes, 5 481 450 occurrences et 53 835 formes lexicales) fait d'abord l’objet d’une classification hiérarchique descendante (CDH). Pour l’interpréter, on mobilise … Continue reading Pascal Marchand – A la recherche des signes complotistes en ligne: exploration et expérimentation par la textométrie.
Séminaire algorithmique : Vincent Jugé (LIGM, Univ. G. Eiffel, Paris Est), « Write-efficient updates for AVL trees »
Sciences 3- S3 351Balanced binary search trees are a common data structure for implementing ordered sets, with three kinds of queries: checking whether a given value belongs to the set, inserting a value, and deleting a value; the two latter queries require updating the data structure. Some implementations, like red-black trees or weak AVL trees, allow efficient update … Continue reading Séminaire algorithmique : Vincent Jugé (LIGM, Univ. G. Eiffel, Paris Est), « Write-efficient updates for AVL trees »
Laura Luzzi – Finite blocklength secrecy analysis of polar and Reed-Muller codes in binary erasure wiretap channels
Sciences 3- S3 351Physical layer security aims to exploit the randomness of noisy channels in order to enhance security through coding and signal processing techniques. Unlike cryptography, it does not place any limitations on the adversary's computational power, but relies on an asymmetry in the channel quality between the legitimate users and the adversary. In this talk, we … Continue reading Laura Luzzi – Finite blocklength secrecy analysis of polar and Reed-Muller codes in binary erasure wiretap channels
Séminaire Image : « Balancing Accuracy and Efficiency in Budget-Aware Early-Exiting Neural Networks », Youva Addad
ENSICAEN - Batiment F - Salle F-200 6 Bd Maréchal Juin , CaenNous aurons le plaisir d'écouter Youva Addad, doctorant de l'équipe Image. Il donnera un séminaire IMAGE le jeudi 13 mars 2025 à 14h en salle de séminaire F-200. Titre : "Balancing Accuracy and Efficiency in Budget-Aware Early-Exiting Neural Networks" Résumé : Deep learning models have achieved remarkable success, but they often come with high computational … Continue reading Séminaire Image : « Balancing Accuracy and Efficiency in Budget-Aware Early-Exiting Neural Networks », Youva Addad
Séminaire Image : « PETRA: Parallel End-to-End Training with Reversible Architectures », Edouard Oyallon
ENSICAEN - Batiment F - Salle F-200 6 Bd Maréchal Juin , CaenNous aurons le plaisir d'écouter Edouard Oyallon, Équipe MLIA, Sorbonne université. Il donnera un séminaire IMAGE le jeudi 20 mars 2025 à 14h en salle de séminaire F-200. Titre : "PETRA: Parallel End-to-End Training with Reversible Architectures" Résumé : Deep learning models are increasingly large, requiring new strategies for efficient training. In this talk, I … Continue reading Séminaire Image : « PETRA: Parallel End-to-End Training with Reversible Architectures », Edouard Oyallon
Séminaire Image : « Decomposable Symbolic Regression Using Transformers and Neural Network-Assisted Genetic Algorithms », Giorgio Morales
ENSICAEN - Batiment F - Salle F-200 6 Bd Maréchal Juin , CaenNous aurons le plaisir d'écouter Giorgio Morales, post-doc de l'équipe Image. Il donnera un séminaire IMAGE le jeudi 3 avril 2025 à 14h en salle de séminaire F-200. Titre : "Decomposable Symbolic Regression Using Transformers and Neural Network-Assisted Genetic Algorithms" Résumé : One of the goals of science is to discover laws that serve as … Continue reading Séminaire Image : « Decomposable Symbolic Regression Using Transformers and Neural Network-Assisted Genetic Algorithms », Giorgio Morales
Kévin Carrier – Combinatorial Attacks On The Decoding Problem
Sciences 3- S3 351The decoding problem is fundamental in post-quantum cryptography. It can be broadly described as essentially solving a linear system with a non-linear constraint on the solution. Phrased this way, the problem applies to both code-based and lattice-based cryptography. For example, the linear system may be defined over FF_q, with the non-linear constraint being a condition … Continue reading Kévin Carrier – Combinatorial Attacks On The Decoding Problem
Séminaire Algorithmique : Josselin Guéneron (GREYC) « Repeated Stochastic Coalition Formation: representations and algorithmic approaches »
Sciences 3- S3 351Coalition formation is a cooperative game theory framework in which a set of agents, required to perform implicit or explicit tasks, must be divided into subgroups (called coalitions), according to collective criteria and a utility function describing the utility of each coalition. This is equivalent to a problem of partitioning the set of agents. The … Continue reading Séminaire Algorithmique : Josselin Guéneron (GREYC) « Repeated Stochastic Coalition Formation: representations and algorithmic approaches »
Séminaire Image : « Multi-modal Identity Extraction », Ryan Webster
ENSICAEN - Batiment F - Salle F-200 6 Bd Maréchal Juin , CaenNous aurons le plaisir d'écouter Ryan Webster, post-doctorant à l'INRIA Rennes. Il donnera un séminaire IMAGE le jeudi 24 avril 2025 à 14h en salle de séminaire F-200. Titre : "Multi-modal Identity Extraction" Résumé : Foundational Vision Language Models (VLMs) exhibit extremely general capabilities derived from their web-scale training data. Because web data inherently contains … Continue reading Séminaire Image : « Multi-modal Identity Extraction », Ryan Webster