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

89

Number of records

14

Publishers' policy on open archives

Mapping of collaborations

Tags

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