| Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Publications PolSys | 2023 | 2024 | 2025 | Total |
|---|---|---|---|---|
| Books | 0 | 0 | 0 | 0 |
| Edited books | 0 | 0 | 0 | 0 |
| Journal articles | 7 | 7 | 0 | 14 |
| Book chapters | 0 | 0 | 0 | 0 |
| Conference papers | 7 | 9 | 1 | 17 |
| Habilitations | 1 | 0 | 0 | 1 |
| Thesis | 2 | 1 | 0 | 3 |
- Martin R. Albrecht, G. Leander : “An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphers”, SAC 2012 - 19th International Conference on Selected Areas in Cryptography, vol. 7707, Lecture Notes in Computer Science, Windsor, Canada, pp. 1-15, (Springer) [Albrecht 2013]
- G. Barbu, A. Battistelllo, G. Dabosville, Ch. Giraud, G. Renault, S. Renner, R. Zeitoun : “Combined Attack on CRT-RSA. Why Public Verification Must Not Be Public?”, PKC 2013 - Public-Key Cryptography, vol. 7778, Lecture Notes in Computer Science, Nara, Japan, pp. 198-215, (Springer) [Barbu 2013]
- Ch. Eder, B. Roune : “Signature Rewriting in Gröbner Basis Computation”, ISSAC 2013 - International Symposium on Symbolic and Algebraic Computation, Boston, United States, pp. 331-338, (ACM) [Eder 2013c]
- J.‑Ch. Faugère, J. Svartz : “Gröbner Bases of Ideals Invariant under a Commutative Group: the Non-Modular Case”, Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, ISSAC '13, Boston, United States, pp. 347-354, (ACM) [Faugère 2013a]
- J.‑Ch. Faugère, M. Safey El Din, Th. Verron : “On the Complexity of Computing Gröbner Bases for Quasi-homogeneous Systems”, ISSAC '13 : Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, Boston, Maine, United States, pp. 189-196, (ACM) [Faugère 2013c]
- Q. Guo, M. Safey El Din, L. Zhi : “Computing rational solutions of linear matrix inequalities”, ISSAC 2013 - International Symposium on Symbolic and Algebraic Computation, Boston, United States [Guo 2013]
- A. Joux, C. Pierrot : “The Special Number Field Sieve in $\F _{p^{n}}$, Application to Pairing-Friendly Constructions”, 6th International Conference on Pairing-based Cryptography, Pairing 2013, vol. 8365, Lecture Notes in Computer Science, Beijing, China, pp. 45-61, (Springer International Publishing) [Joux 2013]
- V. Pan, E. Tsigaridas : “On the Boolean complexity of real root refinement”, ISSAC 2013 - International Symposium on Symbolic and Algebraic Computation, Boston, United States, (ACM) [Pan 2013]
- M. Safey El Din : “Critical Point Methods and Effective Real Algebraic Geometry: New Results and Trends”, ISSAC 2013 - 38th International Symposium on Symbolic and Algebraic Computation, Boston, United States, pp. 5-6 [Safey El Din 2013a]
- D. Wang : “Automation of Geometry - Theorem Proving, Diagram Generation, and Knowledge Management”, ADG 2012 - 9th International Workshop Automated Deduction in Geometry, vol. 7993, Lecture Notes in Computer Science, Edinburgh, United Kingdom, pp. 31-32, (Springer) [Wang 2013]
- J. Yang, D. Wang, H. Hong : “Improving Angular Speed Uniformity by C¹ Piecewise Reparameterization”, ADG 2012: Automated Deduction in Geometry, vol. 7993, Lecture Notes in Computer Science, Edinburgh, United Kingdom, pp. 33-47, (Springer) [Yang 2013a]