EN FR
• Legal notice
• Accessibility - non conforme
##### POLSYS - 2016

New Software and Platforms
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography

## Section: Highlights of the Year

### Highlights of the Year

The goal of the RISQ project is to prepare the security industry to the upcoming shift of classical cryptography to quantum-safe cryptography. The RISQ project is a massive effort at the French level to embrace the quantum-safe revolution. The project gather 15 partners : ANSSI, C&S, CEA, Crypto Experts, EADS, ENS Lyon, ENS Paris, Gemalto, Orange, PCQC, PolSys (Inria de Paris), Université de Rennes, Secure IC, Thales CS, and Université de Versailles.

The RISQ project is certainly the biggest (in term of number of partners, as well as funding) industrial project ever organized in quantum-safe cryptography. RISQ is one of few projects accepted in the “Grands Défis du Numérique” which is managed by BPI France, and will be funded thanks to the PIA.

PolSys actively participated to gather the partners of RISQ, and in defining the proposal. PolSys will lead the academic effort in RISQ.

Jointly with LAAS (D. Henrion, S. Naldi), we have released a new Maple library SPECTRA for finding a real point $x=\left({x}_{1},...,{x}_{n}\right)$ such that the symmetric matrix $A\left(x\right)={A}_{0}+{A}_{1}\phantom{\rule{0.166667em}{0ex}}{x}_{1}+\cdots +{A}_{n}\phantom{\rule{0.166667em}{0ex}}{x}_{n}$ is positive semidefinite using exact arithmetic (see http://homepages.laas.fr/henrion/software/spectra/).

Our open source C library SLV has been officially released this year with a presentation at ISSAC . It aims at solating and approximating the real roots of univariate polynomials with integer coefficients (see http://www-polsys.lip6.fr/~elias/soft.html)

#### Awards

Matías Bender received the Distinguished Student Author Award of ISSAC2016 for his paper [22] written with J.-Ch. Faugère , L. Perret and E. Tsigaridas .

###### Best Paper Award:
[22]
M. 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