-
Le séminaire Mathématiques Discrètes, Codes et Cryptographie accueille des chercheurs travaillant sur le thème des mathématiques discrètes et leurs applications à la protection de l'information : cryptographie, codes correcteurs d'erreur, séquences, algorithmes, mais aussi combinatoire et d'autres sujets liés.
Jeudi 30 novembre 2023
10:30 Flavio Salizzoni (Université de Neuchâtel)
Résumé
An upper bound for the solving degree in terms of the degree of regularity
Université Paris 8 - G-2Accurately estimate the computational complexity of solving multivariate polynomial systems has become increasingly important because of their applications in post-quantum cryptography. An important parameter for this purpose is the solving degree. However, computing explicitly the solving degree is in general extremely difficult. For this reason, it is useful to provide upper bounds for the solving degree in terms of other parameters, such as the degree of regularity, the last fall degree, and the Castelnuovo-Mumford regularity. In this talk, we will introduce all these parameters and we will discuss their mutual relations.
Jeudi 21 décembre 2023
10:30 Martin Scotti (Université Paris 8 - LAGA)
Titre bientôt disponible
Université Paris 8 - MR 105