| Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Former team : | ACASA |
| Publications PolSys | 2023 | 2024 | Total |
|---|---|---|---|
| Books | 0 | 0 | 0 |
| Edited books | 0 | 0 | 0 |
| Journal articles | 8 | 6 | 14 |
| Book chapters | 0 | 0 | 0 |
| Conference papers | 7 | 9 | 16 |
| Habilitations | 1 | 0 | 1 |
| Thesis | 2 | 0 | 2 |
- L. BarthĂ©lĂ©my, N. Eyrolles, G. Renault, R. Roblin : “Binary Permutation Polynomial Inversion and Application to Obfuscation Techniques”, Proceedings of the 2nd International Workshop on Software PROtection, Vienna, Austria, (ACM) [BarthĂ©lĂ©my 2016]
- A. Battistello, J.‑S. Coron, E. Prouff, R. Zeitoun : “Horizontal Side-Channel Attacks and Countermeasures on the ISW Masking Scheme”, Lecture Notes in Computer Science, vol. 9813, Cryptographic Hardware and Embedded Systems – CHES 2016, Santa Barbara, CA, United States, pp. 23-39, (Springer) [Battistello 2016]
- S. Belaid, F. Benhamouda, A. Passelègue, E. Prouff, A. Thillard, D. Vergnaud : “Randomness Complexity of Private Circuits for Multiplication”, EUROCRYPT 2016, Vienna, Austria, pp. 616-648 [Belaid 2016]
- M. Bender, J.‑Ch. Faugère, L. Perret, E. Tsigaridas : “A Superfast Randomized Algorithm to Decompose Binary Forms”, ISSAC '16 - 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, pp. 79-86, (ACM) [Bender 2016]
- J. Berthomieu, J.‑Ch. Faugère : “Guessing Linear Recurrence Relations of Sequence Tuples and P-recursive Sequences with Linear Algebra”, ISSAC '16: Proceedings of the 2016 on International Symposium on Symbolic and Algebraic Computation, Waterloo, ON, Canada, pp. 95-102 [Berthomieu 2016]
- B. Bonnard, A. Jacquemard, J. Rouot : “Optimal Control of an Ensemble of Bloch Equations with Applications in MRI”, 55th IEEE Conference on Decision and Control - CDC, Las Vegas, United States, pp. 1608-1613 [Bonnard 2016a]
- B. Bonnard, J.‑Ch. Faugère, A. Jacquemard, M. Safey El Din, Th. Verron : “Determinantal sets, singularities and application to optimal control in medical imagery”, International symposium on symbolic and algebraic computations, Waterloo, Canada, pp. 103-110, (ACM) [Bonnard 2016b]
- B. Boyer, Ch. Eder, J.‑Ch. Faugère, S. Lachartre, F. Martani : “GBLA – Gröbner Basis Linear Algebra Package”, 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, ON, Canada, pp. 135-142 [Boyer 2016]
- E. Cagli, C. Dumas, E. Prouff : “Enhancing Dimensionality Reduction Methods for Side-Channel Attacks”, Lecture Notes in Computer Science, vol. 9514, Smart Card Research and Advanced Applications 14th International Conference, CARDIS 2015, Bochum, Germany, November 4-6, 2015. Revised Selected Papers, Bochum, Germany, pp. 15-33 [Cagli 2016a]
- E. Cagli, C. Dumas, E. Prouff : “Kernel Discriminant Analysis for Information Extraction in the Presence of Masking”, CARDIS 2016 - 15th International Conference on Smart Card Research and Advanced Applications, vol. 10146, Lecture Notes in Computer Science, Cannes, France, pp. 1-22, (Springer) [Cagli 2016b]
- J.‑S. Coron, A. Greuet, E. Prouff, R. Zeitoun : “Faster Evaluation of SBoxes via Common Shares”, Lecture Notes in Computer Science, vol. 9813, Cryptographic Hardware and Embedded Systems – CHES 2016, Santa Barbara, CA, United States, pp. 498-514, (Springer) [Coron 2016a]
- J.‑S. Coron, J.‑Ch. Faugère, G. Renault, R. Zeitoun : “Factoring $N=p^r q^s$ for Large $r$ and $s$”, RSA Conference Cryptographers' Track, Topics in Cryptology – CT-RSA 2016, San Francisco, United States [Coron 2016b]
- I. Emiris, A. Mantzaflaris, E. Tsigaridas : “On the Bit Complexity of Solving Bilinear Polynomial Systems”, ISSAC '16 - Proc. ACM International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, pp. 215-222, (ACM) [Emiris 2016]
- J.‑Ch. Faugère, P.‑J. Spaenlehauer, J. Svartz : “Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems”, Proceedings of ISSAC 2016, Waterloo, Canada, pp. 223-230, (ACM) [Faugère 2016d]
- M. Safey El Din, P.‑J. Spaenlehauer : “Critical Point Computations on Smooth Varieties: Degree and Complexity bounds”, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, pp. 183-190 [Safey El Din 2016]