Mathématiques discrètes, Codage et Cryptographie [MC²]

L’activité d’équipe Mathématiques de l’information, des communications et du calcul [MC2] se situe à l’interface des mathématiques fondamentales et de l’informatique.



Leurs principaux domaines d’investigation sont :

  • la théorie des automates
  • la théorie de la complexité, recherche opérationnelle, graphes
  • le codage correcteur, combinatoire extrémale
  • la géométrie algébrique, théorie des nombres, et leurs applications.

Membres de l’équipe


Géométrie algébrique
Codage et cryptographie (aspects mathématiques), Algorithmique


Les publications de l’équipe

67 documents

Article dans une revue

  • Olivier Hudry, Antoine Lobstein. Some Complexity Considerations on the Uniqueness of Solutions for Satisfiability and Colouring Problems. soumis pour publication, 2019. ⟨hal-02287571⟩
  • Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch. On subtrees of the representation tree in rational base numeration systems. Discrete Mathematics \& Theoretical Computer Science, 2018, 20 (1). ⟨hal-02287876⟩
  • Sihem Mesnager, F Ozbudak, A. Smak, Gérard Cohen. On q-ary (partially) bent and plateaued functions over F_q. European Journal of Combinatorics, 2018. ⟨hal-02287547⟩
  • Gérard Cohen, Emanuela Fachini, J. Korner. Path separation by short cycles. Journal of Graph Theory, 2017, 85 (1), pp.107-114. ⟨hal-02287545⟩
  • Jean-Pierre Flori, Gérard Cohen. On a generalised combinatorial conjecture involving addition mod 2^k -1. Int. J. Information and Coding Theory, 2017, 4 (2/3), pp.107-115. ⟨hal-02287546⟩
  • Sihem Mesnager, Gérard Cohen. Fast algebraic immunity of Boolean functions. Advances in Mathematics of Communications, 2017, 11 (2), pp.373-377. ⟨hal-02287573⟩
  • Matthieu Rambaud, Gérard Memmi. Note sur la cryptanalyse de Diffie-Hellman. Génie Logiiel, 2017, pp.56-60. ⟨hal-02287591⟩
  • Hugues Randriambololona. On metric convexity, the discrete Hahn-Banach theorem, separating systems and sets of points forming only acute angles. Int. J. of Information and Coding Theory, 2017, 4 (2/3), pp.159-169. ⟨hal-02287790⟩
  • Olivier Hudry, Antoine Lobstein. More Results on the Complexity of Identifying Problems in Graphs. Theoretical Computer Science , 2016, 626, pp.1-12. ⟨hal-02287134⟩
  • Gérard Cohen, Sihem Mesnager, Hugues Randriambololona. Yet another variation on minimal linear codes. Advances in mathmatics of Communications, 2016, 10 (1), pp.53-61. ⟨hal-02287564⟩
  • Gérard Cohen, Emanuela Fachini, J. Korner. Zero-error capacity of binary channels with memory. IEEE Transactions Information Th., 2016, 62, pp.3-7. ⟨hal-02287281⟩
  • Iiro Honkala, Olivier Hudry, Antoine Lobstein. On the Ensemble of Optimal Identifying Codes in a Twin-Free Graph. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences, 2016, 8, pp.139-153. ⟨hal-02287017⟩
  • Laurent Decreusefond, Ian Flint, Anais Vergne. A note on the simulation of the Ginibre point process. Journal of Applied Probability, 2015, 52 (4). ⟨hal-02286806⟩
  • Iiro Honkala, Olivier Hudry, Antoine Lobstein. On the Ensemble of Optimal Dominating and Locating-Dominating Codes in a Graph. Information Processing Letters, 2015, 115, pp.699-702. ⟨hal-02287016⟩
  • David Madore, Fabrice Orgogozo. Calculabilité de la cohomologie étale modulo $\ell$. Algebra Number Theory, 2015, 9 (7), pp.1647-1739. ⟨10.2140/ant.2015.9.1647⟩. ⟨hal-02287872⟩
  • H. Randriambololona. On products and powers of linear codes under componentwise multiplication. Contemporary Mathematics, 2015. ⟨hal-02287120⟩
  • Hugues Randriam, L. Sok, Patrick Solé. Lower bounds on the minimum distance of long codes in the Lee metric. Designs, Codes and Cryptography, 2015, 74 (2), pp.441-452. ⟨hal-02286807⟩
  • Olivier Hudry. Complexité et théorie du vote. Bulletin de la Société française de recherche opérationnelle et d’aide à la décision (ROADEF), 2015, 33, pp.7-14. ⟨hal-02287100⟩
  • Olivier Hudry. Complexity results for extensions of median orders to different types of remoteness. Annals of Operations Research, Springer Verlag, 2015, 225, pp.111-123. ⟨hal-02278687⟩
  • Olivier Hudry. Characterization of the majority matrices of profiles of equivalence relations. Mathematics and Social Sciences, 2015. ⟨hal-02286291⟩
  • I. Honkala, Olivier Hudry, Antoine Lobstein. On the number of optimal identifying codes in a twin-free graph. Discrete Applied Mathematics, Elsevier, 2015, 180, pp.111-119. ⟨hal-02286996⟩
  • Gérard Cohen, Sihem Mesnager. On construction of semi-bent funvtions from bent functions. AMS Contemporary Mathematics, 2014, 625, pp.141-154. ⟨hal-02286937⟩
  • Hugues Randriambololona. An upper bound of Singleton type for componentwise products of linear codes. IEEE Trans. Inform. Theory, 2013, 59 (12), pp.7936-7939. ⟨hal-02286809⟩
  • Gérard Cohen, Claudia Malvenuto. Cyclic colliding permutations. ENDM, 2013, 40, pp.223-227. ⟨hal-02286826⟩
  • Gérard Cohen, Emanuela Fachini, J. Korner. More on connector families. ENDM, 2013, 44, pp.23-29. ⟨hal-02286830⟩
  • Hugues Randriambololona. (2,1)-separating systems beyond the probabilistic bound. Israel Journal of Mathematics, 2013, 195 (1), pp.171-186. ⟨hal-02278565⟩
  • Olivier Hudry. Contributions to Mathematical Psychology. Electronic Notes in Discrete Mathematics, 2013, 42, pp.1-7. ⟨hal-02286700⟩
  • Olivier Hudry. Complexity of computing median linear orders and variants. Electronic Notes in Discrete Mathematics, 2013, 42, pp.57-64. ⟨hal-02286384⟩
  • Irène Charon, Olivier Hudry. Lexicographic decomposition of preferences. Electronic Notes in Discrete Mathematics, 2013, 42, pp.25-32. ⟨hal-02286383⟩
  • H. Randriambololona. Asymptotically good binary linear codes with asymptotically good self-intersection spans. IEEE Trans. Inform. Theory, 2013, 59 (5), pp.3038-3045. ⟨hal-02286501⟩
  • Irène Charon, I. Honkala, Olivier Hudry, Antoine Lobstein. Minimum Sizes of Identifying Codes in Graphs Differing by One Vertex. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences, 2013, 5, pp.119-136. ⟨hal-02286382⟩
  • Rémi Lassalle, A. S. Ustunel. Local Invertibility of Adapted Shifts on Wiener Space and Related Topics. Malliavin Calculus and Stochastic Analysis Springer Proceedings in Mathematics & Statistics Volume 34, 2013, pp 25-76 , 2013, 34, pp.25-76. ⟨hal-02286658⟩
  • A. Suleyman Ustunel. transportation cost inequalities for diffusions under uniform distance. Springer proceedings in Mathematics and Statistics, 2012, 22, pp.203-213. ⟨hal-02286427⟩
  • Olivier Hudry. NP-hardness of the computation of a median equivalence relation in classification (Régnier’s problem). Mathematics and Social Sciences, 2012, 197, pp.83-97. ⟨hal-02286265⟩
  • Olivier Hudry. Psychologie mathématique. Mathematics and Social Sciences, 2012, 199, pp.5-6. ⟨hal-02286701⟩
  • Hugues Randriambololona. Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method. Journal of Complexity, 2012, 28 (4), pp.489-517. ⟨hal-02278567⟩
  • Gérard Cohen, Emanuela Fachini, J. Korner. Skewincidence. IEEE Trans. Inform Theory, 2011, 57 (11), pp.7313-7316. ⟨hal-02278600⟩
  • Sihem Mesnager, Gérard Cohen. On the links of some semi-bent functions with Kloosterman sums. LNCS , 2011, 6639, pp.263-272. ⟨hal-02278602⟩
  • Denis Feyel, A. S. Ustunel. Log-concave measures. TWMS J. Pure Applied Math, 2010, 1, pp.92-105. ⟨hal-02278563⟩
  • Hugues Randriambololona, Joseph J. Boutros. Le code spatio-temporel d'Aladin-Pythagore. Traitement du Signal, 2010, 27 (2), pp.147-160. ⟨hal-02278566⟩
  • A. Suleyman Ustunel. Persistence of invertibility in the Wiener space. Commun. Stoch. Anal., 2010, 4 (2), pp.201-213. ⟨hal-02278564⟩
  • Irène Charon, G. Hébrail, Olivier Hudry. Journées de 2007 de la Société francophone de classification. Avant-propos. Mathematics and Social Sciences, 2009, 187, pp.5-6. ⟨hal-02286699⟩

Communication dans un congrès

  • Olivier Hudry, Antoine Lobstein. Complexity results on dominating codes. The Second Malta Conference in Graph Theory and Combinatorics, Jun 2017, Qawra, Malta. ⟨hal-02287572⟩
  • Olivier Hudry. Challenges, Solutions and Implications for Large Scale Enterprise Systems: OR in the Age of Big Data. 6th International Conference on Operations Research and Enterprise Systems (ICORES 2017), Feb 2017, Porto, Portugal. ⟨hal-02287562⟩
  • Olivier Hudry. Lexicographic decomposition of preferences into partial orders. European Chapter on Combinatorial Optimization XXIX (ECCO XXIX), May 2016, Budapest, Hungary. ⟨hal-02287316⟩
  • Matthieu Rambaud. optimal Chudnovsky Chudnovsky multiplication algorithms. WAIFI 2014, Jul 2015, gebze, Turkey. ⟨hal-02287379⟩
  • Olivier Hudry. Computation of the winner of an election. Decision making and Social Choice, Apr 2015, Bruxelles, Belgium. ⟨hal-02287274⟩
  • Sihem Mesnager, Gérard Cohen. On minimal and almost-minimal linear codes. 21st International Symposium MTNS, Jul 2014, Groningen, Netherlands. pp.928-931. ⟨hal-02286938⟩
  • Irène Charon, I. Honkala, Olivier Hudry, Antoine Lobstein. Variations of identifying codes in graphs obained by adding or removing one vertex. 9th International colloquium on graph theory and combinatorics (ICGT 2014), Jul 2014, Grenoble, France. pp.1-4. ⟨hal-02286931⟩
  • J. Bringer, Hervé Chabanne, Mélanie Favre, Alain Patey, Thomas Schneider, et al.. GSHADE: faster privacy-preserving distance computation and biometric identification. 2nd ACM workshop on Information hiding and multimedia security, Jun 2014, Salzburg, Austria. pp.187-198, ⟨10.1145/2600918.2600922⟩. ⟨hal-02287124⟩
  • Alain Patey, Hervé Chabanne, J. Bringer, Roch Lescuyer. Efficient and Strongly Secure Dynamic Domain-Specific Pseudonymous Signatures for ID Documents. 18th International Conference, FC 2014,, Mar 2014, Christ Church, Barbados. pp.255-272, ⟨10.1007/978-3-662-45472-5_16⟩. ⟨hal-02287123⟩
  • Olivier Hudry. Application of the descent with mutations (DWM) metaheuristic to the computation of a median equivalence relation. 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2013, Enschede, Netherlands. pp.129-132. ⟨hal-02286718⟩
  • Olivier Hudry. Conjectures on identifying codes. Wokshop on identifying codes, Feb 2013, Turku, Finland. ⟨hal-02288351⟩
  • Olivier Hudry. NP-hardness of the aggregation of preferences. 2012 meeting of the European Mathematical Psychology Group (EMPG 2012), Aug 2012, Pampelune, Spain. ⟨hal-02286698⟩
  • Julien Bringer, Alain Patey. VLR Group Signatures: How to Achieve Both Backward Unlinkability and Efficient Revocation Checks. International Conference on Security and Cryptography (SECRYPT), Jul 2012, Rome, Italy. pp.215-220. ⟨hal-02288341⟩
  • Olivier Hudry. Majority graphs of profiles of equivalence relations and complexity of Régnier’s problem. 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), May 2012, Munich, Germany. pp.147-150. ⟨hal-02286316⟩
  • Irène Charon, Olivier Hudry. A branch and bound method for the aggregation of symmetric relations. 2nd International Symposium on Combinatorial Optimization (ISCO 2012), Apr 2012, Athènes, Greece. pp.127-130. ⟨hal-02286302⟩
  • Olivier Hudry. A branch and bound algorithm to compute a median permutation. Algorithms & Permutations 2012, Feb 2012, Paris, France. ⟨hal-02286697⟩
  • Olivier Hudry. Structural properties of identifying codes: some results, conjectures and open problems. Workshop on Identifying Codes, Nov 2011, Bordeaux, France. ⟨hal-02286696⟩
  • Olivier Hudry. Complexity of the aggregation of orders into median orders. Computational Foundations of Social Choice, Mar 2010, Dagstuhl, Germany. ⟨hal-02286695⟩

Ouvrage (y compris édition critique et traduction)

  • Irène Charon, Olivier Hudry. Introduction à l’optimisation continue et discrète. Lavoisier, pp.500, 2019. ⟨hal-02288068⟩

Chapitre d'ouvrage

  • Olivier Hudry. Operations research and voting theory. Operations Research and Enterprise Systems, Springer, 2018. ⟨hal-02287923⟩
  • Felix Fischer, Olivier Hudry, Rolf Niedermeier. Weighted Tournament Solutions. Handbook of Computational Social Choice, Cambridge University Press, pp.85-102, 2016. ⟨hal-02286702⟩
  • Laurent Decreusefond, Aurélien Vasseur. Asymptotics of superposition of point processes. Geometry of Science Information, Springer, pp.187-194, 2015. ⟨hal-02287232⟩
  • J. Sakarovitch. Automata and expressions. AutoMathA Handbook, European Mathematical Society, 2015. ⟨hal-02286710⟩
  • Irène Charon, Olivier Hudry. 2 : The noising methods. Heuristics: Theory and Applications, Nova Publishers, pp.1-30, 2013. ⟨hal-02286568⟩
  • Irène Charon, Olivier Hudry. 3 : Branch-and-bound methods. Concepts of Combinatorial Optimization, Wiley-ISTE Ltd, pp.41-69, 2010. ⟨hal-02278612⟩

Dernières actualités du LTCI