index - Exact Computing

The research activities of the ECO group covers a large spectrum at the interface of computer algebra, coding theory and cryptography, with motivations ranging from the theoretical foundations to the practical applications of these domains. The originality of our approach is to combine various aspects of computer science and mathematics. In particular, we are interested in:

  • Algebra to understand and to describe the underlying structure of the objects
  • Combinatorics to analyse their properties
  • Arithmetic to efficiently solve computational problems
  • Softwares to turn our theoretical results into effective solutions
  • Complexity theory, to assess the efficiency of the algorithms and the security of cryptosystems

More precisely, our current works include the following problems:

  • Computer Algebra: efficient algorithms in linear algebra, sparse or in-place polynomial arithmetic, finite field arithmetic, verified computing
  • Cryptography: public-key cryptography, elliptic curves, side-channel attacks and countermeasures, design and proofs of protocols, advanced cryptography, multi-party computation, post-quantum crypto
  • Error Correcting Codes: algebraic decoding algorithms, bounds on parameters, fault tolerant linear algebra

Open Access Files

93 %

Number of full texts

85

Number of records

14

Publishers' policy on open archives

Mapping of collaborations

Tags

Deterministic algorithm Expander mixing lemma Supersingular isogeny Diffie-Hellman Cofactorization Mixed-radix number system Algèbre linéaire exacte Coding theory Digital Signatures Collision Attacks Algebraic Coding Theory Class Groups Arithmetic complexity Algèbre linéaire Exact linear algebra Cryptography based on class groups of an imaginary quadratic field Polynomial multiplication Randomized algorithms Kolmogorov complexity Circuits arithmétiques Correlation Electromagnetic Analysis Covering systems of congruences Computer algebra Arithmétique polynomiale Information inequalities Computations on polynomials Calcul formel Cryptosystem RSA Benchmarking Cryptographic accumulators Certification Design of algorithms Digital arithmetic Algorithms and containers SIMD Arithmétique modulaire Relaxed algorithm Bornes combinatoires Domain Specific Language Cauchy matrices Polynomial root finding Clustering Algorithms Computation on polynomials Correct rounding Computer Algebra Cauchy interpolation with poles Complexity Analysis Discrete circle Conditional independence structures Information-theoretic cryptography Bases d'approximant Digital straight segment recognition Codes correcteurs d'erreurs Linearly homomorphic encryption Arithmetic Online algorithm Dataflow Parallelism Communication complexity Chinese remainder codes Class groups of quadratic imaginary number fields Side-channel attacks Arithmétique en place Correlation electromagnetic analysis CADO-NFS Arithmetic circuits Analyse Simultaneous rational function reconstruction Decision problems Design pattern Class group cryptography Scalar multiplication Database query evaluation and containment Montgomery curve Cutting Strategy Elliptic curve method Double-base representation Multi-party computation Algorithm Finite fields Complexity Bivariate polynomial systems Floating-point arithmetic Algorithme Bootstrapping Decoding failure probability analysis Algorithmes Asymptotics Cryptographic primitives Differential privacy Communication compelxity Triangular set Twisted Edwards curve Coding and cryptography days 2014 Control flow divergence Polynomial Modular Number System Dual pairing vector spaces Efficient arithmetic Complexity theory Algebraic algorithms Class groups of quadratic fields