Bibliography
Major publications by the team in recent years
-
1M. R. Bender, J.-C. Faugère, L. Perret, E. Tsigaridas.
A Superfast Randomized Algorithm to Decompose Binary Forms, in: ISSAC '16 - 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, ACM, July 2016, pp. 79-86. [ DOI : 10.1145/2930889.2930896 ]
https://hal.inria.fr/hal-01363545
Doctoral Dissertations and Habilitation Theses
-
2L. Perret.
Gröbner bases techniques in Quantum-Safe Cryptography, UPMC - Paris 6 Sorbonne Universités, December 2016, Habilitation à diriger des recherches.
https://tel.archives-ouvertes.fr/tel-01417808 -
3G. Renault.
Contribution à la Résolution Algébrique et Applications en Cryptologie, UPMC - Paris 6 Sorbonne Universités, December 2016, Habilitation à diriger des recherches.
https://hal.inria.fr/tel-01416242 -
4T. Verron.
Regularisation of Gröbner basis computations for weighted and determinantal systems, and an application to medical imagery, Université Pierre et Marie Curie, September 2016.
https://tel.archives-ouvertes.fr/tel-01404406 -
5A. Wallet.
The point decomposition problem in Jacobian varieties , Université Pierre & Marie Curie - Paris 6, November 2016.
https://tel.archives-ouvertes.fr/tel-01407675
Articles in International Peer-Reviewed Journals
-
6J. Berthomieu, B. Boyer, J.-C. Faugère.
Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences, in: Journal of Symbolic Computation, 2016, 48 p. [ DOI : 10.1016/j.jsc.2016.11.005 ]
https://hal.inria.fr/hal-01253934 -
7K. Chakraborty, S. Sarkar, S. Maitra, B. Mazumdar, D. Mukhopadhyay, E. Prouff.
Redefining the transparency order, in: Designs, Codes and Cryptography, 2016. [ DOI : 10.1007/s10623-016-0250-3 ]
https://hal.archives-ouvertes.fr/hal-01399584 -
8C. Eder, J.-C. Faugère.
A survey on signature-based algorithms for computing Gröbner basis computations, in: Journal of Symbolic Computation, 2016, pp. 1-75. [ DOI : 10.1016/j.jsc.2016.07.031 ]
https://hal.inria.fr/hal-00974810 -
9J.-C. Faugère, C. Mou.
Sparse FGLM algorithms, in: Journal of Symbolic Computation, May 2017, vol. 80, no 3, pp. 538 - 569. [ DOI : 10.1016/j.jsc.2016.07.025 ]
https://hal.inria.fr/hal-00807540 -
10J.-C. Faugère, A. Otmani, L. Perret, F. De Portzamparc, J.-P. Tillich.
Folding Alternant and Goppa Codes with Non-Trivial Automorphism Groups, in: IEEE Transactions on Information Theory, 2016, vol. 62, no 1, pp. 184 - 198. [ DOI : 10.1109/TIT.2015.2493539 ]
https://hal.inria.fr/hal-01244609 -
11J.-C. Faugère, A. Otmani, L. Perret, F. De Portzamparc, J.-P. Tillich.
Structural Cryptanalysis of McEliece Schemes with Compact Keys, in: Designs, Codes and Cryptography, April 2016, vol. 79, no 1, pp. 87-112. [ DOI : 10.1007/s10623-015-0036-z ]
https://hal.inria.fr/hal-00964265 -
12J.-C. Faugère, M. Safey El Din, T. Verron.
On the complexity of computing Gröbner bases for weighted homogeneous systems, in: Journal of Symbolic Computation, 2016. [ DOI : 10.1016/j.jsc.2015.12.001 ]
https://hal.inria.fr/hal-01097316 -
13D. Henrion, S. Naldi, M. Safey El Din.
Exact algorithms for linear matrix inequalities, in: SIAM Journal on Optimization, September 2016, vol. 26, no 4, pp. 2512–2539. [ DOI : 10.1137/15M1036543 ]
https://hal.archives-ouvertes.fr/hal-01184320 -
14D. Henrion, S. Naldi, M. Safey El Din.
Real root finding for determinants of linear matrices, in: Journal of Symbolic Computation, May 2016, vol. 74, pp. 205-238. [ DOI : 10.1016/j.jsc.2015.06.010 ]
https://hal.archives-ouvertes.fr/hal-01077888 -
15M. Safey El Din, E. Schost.
A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets, in: Journal of the ACM, 2016, Major revision, accepted for publication to Journal of the ACM.
https://hal.inria.fr/hal-00849057 -
16A. Strzebonski, E. Tsigaridas.
Univariate real root isolation over a single logarithmic extension of real algebraic numbers, in: Springer Proceedings in Mathematics & Statistics, 2017, Ilias S. Kotsireas and Edgar Martínez-Moro.
https://hal.inria.fr/hal-01001820 -
17E. Tsigaridas.
SLV: a software for real root isolation, in: ACM Communications in Computer Algebra, November 2016, vol. 50, no 3, pp. 117 - 120. [ DOI : 10.1145/3015306.3015317 ]
https://hal.inria.fr/hal-01422209 -
18D. Wang.
On the Connection Between Ritt Characteristic Sets and Buchberger–Gröbner Bases, in: Mathematics in Computer Science, 2016, vol. 10, no 4, pp. 479–492. [ DOI : 10.1007/s11786-016-0279-8 ]
https://hal.inria.fr/hal-01399579
International Conferences with Proceedings
-
19L. Barthelemy, N. Eyrolles, G. Renault, R. Roblin.
Binary Permutation Polynomial Inversion and Application to Obfuscation Techniques, in: 2nd International Workshop on Software PROtection, Vienna, Austria, ACM, October 2016. [ DOI : 10.1145/2995306.2995310 ]
https://hal.inria.fr/hal-01388108 -
20A. Battistello, J.-S. Coron, E. Prouff, R. Zeitoun.
Horizontal Side-Channel Attacks and Countermeasures on the ISW Masking Scheme, in: 18th Conference on Cryptographic Hardware and Embedded Systems (CHES 2016), Santa Barbara, CA, United States, Cryptographic Hardware and Embedded Systems – CHES 2016, Springer, August 2016, vol. 9813, pp. 23 - 39. [ DOI : 10.1007/978-3-662-53140-2_2 ]
https://hal.archives-ouvertes.fr/hal-01399577 -
21S. Belaid, F. Benhamouda, A. Passelègue, E. Prouff, A. Thillard, D. Vergnaud.
Randomness Complexity of Private Circuits for Multiplication, in: EUROCRYPT 2016, Vienna, Austria, May 2016, pp. 616-648. [ DOI : 10.1007/978-3-662-49896-5_22 ]
https://hal.archives-ouvertes.fr/hal-01324823 -
23J. Berthomieu, J.-C. Faugère.
Guessing Linear Recurrence Relations of Sequence Tuples and P-recursive Sequences with Linear Algebra, in: 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, ON, Canada, July 2016, pp. 95-102. [ DOI : 10.1145/2930889.2930926 ]
https://hal.inria.fr/hal-01314266 -
24B. Bonnard, J.-C. Faugère, A. Jacquemard, M. Safey El Din, T. Verron.
Determinantal sets, singularities and application to optimal control in medical imagery, in: International symposium on symbolic and algebraic computations, Waterloo, Canada, ACM, July 2016, pp. 103-110. [ DOI : 10.1145/2930889.2930916 ]
https://hal.inria.fr/hal-01307073 -
25B. Bonnard, A. Jacquemard, J. Rouot.
Optimal Control of an Ensemble of Bloch Equations with Applications in MRI, in: 55th IEEE Conference on Decision and Control - CDC, Las Vegas, United States, December 2016.
https://hal.inria.fr/hal-01287290 -
26B. Boyer, C. Eder, J.-C. Faugère, S. Lachartre, F. Martani.
GBLA – Gröbner Basis Linear Algebra Package, in: 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, ON, Canada, July 2016, pp. 135-142. [ DOI : 10.1145/2930889.2930914 ]
https://hal.inria.fr/hal-01276346 -
27J.-S. Coron, J.-C. Faugère, G. Renault, R. Zeitoun.
Factoring for Large and , in: RSA Conference Cryptographers' Track, San Francisco, United States, Topics in Cryptology – CT-RSA 2016, February 2016. [ DOI : 10.1007/978-3-319-29485-8_26 ]
https://hal.inria.fr/hal-01250302 -
28J.-S. Coron, A. Greuet, E. Prouff, R. Zeitoun.
Faster Evaluation of SBoxes via Common Shares, in: 18th International Conference on Cryptographic Hardware and Embedded Systems (CHES 2016), Santa Barbara, CA, United States, Cryptographic Hardware and Embedded Systems – CHES 2016, Springer, August 2016, vol. 9813, pp. 498 - 514. [ DOI : 10.1007/978-3-662-53140-2_24 ]
https://hal.archives-ouvertes.fr/hal-01399578 -
29I. Z. Emiris, A. Mantzaflaris, E. Tsigaridas.
On the Bit Complexity of Solving Bilinear Polynomial Systems, in: ISSAC '16 - 41st International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, ACM, July 2016, pp. 215-222. [ DOI : 10.1145/2930889.2930919 ]
https://hal.inria.fr/hal-01401134 -
30J.-C. Faugère, P.-J. Spaenlehauer, J. Svartz.
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems, in: International Symposium on Symbolic and Algebraic Computation (ISSAC 2016), Waterloo, Canada, ACM, July 2016, pp. 223-230. [ DOI : 10.1145/2930889.2930927 ]
https://hal.inria.fr/hal-01314651 -
31M. Safey El Din, P.-J. Spaenlehauer.
Critical Point Computations on Smooth Varieties: Degree and Complexity bounds, in: International Symposium on Symbolic and Algebraic Computation (ISSAC), Waterloo, Canada, July 2016, pp. 183–190. [ DOI : 10.1145/2930889.2930929 ]
https://hal.inria.fr/hal-01312750
Scientific Books (or Scientific Book chapters)
-
32C. Carlet, E. Prouff.
Polynomial Evaluation and Side Channel Analysis, in: The New Codebreakers, Lecture Notes in Computer Science, Springer, 2016, vol. 9100, pp. 315 - 341. [ DOI : 10.1007/978-3-662-49301-4_20 ]
https://hal.archives-ouvertes.fr/hal-01399573
Other Publications
-
33G. Renault, T. Vaccon.
On the p-adic stability of the FGLM algorithm, 2016, working paper or preprint.
https://hal.archives-ouvertes.fr/hal-01266071 -
34M. Safey El Din, E. Schost.
Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization, May 2016, working paper or preprint.
https://hal.inria.fr/hal-01319729