OURAGAN - 2019 - Annual activity report

OURAGAN

OURAGAN - 2019

Project-Team Ouragan

Team, Visitors, External Collaborators

Overall Objectives

Overall Objectives
Scientific ground

Research Program

Basic computable objects and algorithms
Algorithmic Number Theory
Topology in small dimension
Algebraic analysis of functional systems

Application Domains

Security of cryptographic systems
Robotics
Control theory
Signal processing

Highlights of the Year

New Software and Platforms

ISOTOP
RS
A NewDsc
SIROPA
MPFI

New Results

Certified non-conservative tests for the structural stability of discrete multidimensional systems
Computing period matrices and the Abel-Jacobi map of superelliptic curves
Voronoi diagram of orthogonal polyhedra in two and three dimensions
A symbolic computation approach towards the asymptotic stability analysis of differential systems with commensurate delays
On the computation of stabilizing controllers of multidimensional systems
Algebraic aspects of the exact signal demodulation problem
General closed-form solutions of the position self-calibration problem
Certified lattice reduction
Using Maple to analyse parallel robots
On the effective computation of stabilizing controllers of 2D systems
Updating key size estimations for pairings
Matrix formulae for Resultants and Discriminants of Bivariate Tensor-product Polynomials
Separation bounds for polynomial systems
On the maximal number of real embeddings of minimally rigid graphs in $ℝ^{2}$ , $ℝ^{3}$ and $S^{2}$
Multilinear Polynomial Systems: Root Isolation and Bit Complexity

Bilateral Contracts and Grants with Industry

Bilateral Contracts with Industry

Partnerships and Cooperations

National Initiatives
European Initiatives
International Initiatives

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries
Popularization

Bibliography

Major publications
Publications of the year
References in notes

Previous |

Home | Next next

Section: New Results

Updating key size estimations for pairings

Recent progress on NFS imposed a new estimation of the security of pairings. In [15], we study the best attacks against some of the most popular pairings. It allows us to propose new pairing-friendly curves of 128 bits and 192 bits of security.

Previous |

Home | Next next