Pierre Bienvenu

Pierre Bienvenu

  • Research Scientist
  • Applied Discrete Mathematics and Cryptography

Biographical sketch

Research interests

I work in arithmetic combinatorics, at the interface of number theory, combinatorics, harmonic analysis and ergodic theory, combining analytic, combinatorial, probabilistic and algebraic methods. A recurring theme is the tension between additive and multiplicative structure, and between structure and randomness. My current focus is on finite fields and their applications to cryptography: I study what makes a map of a finite field simple and structured, or complex and random-like, through complexity measures such as the additive index, the Carlitz rank and the multiplicative (cyclotomic) index, with consequences for the design and security of cryptographic functions. My earlier work concerns additive patterns in the primes, sumsets and additive decompositions of arithmetic sets, and higher-order Fourier analysis.

A few keywords:

  • Linearised polynomials
  • Pseudorandomness
  • Higher order Fourier analysis
  • Sum-product estimates.
  • Density of sumsets.

Complete list of publications and preprints

Preprints

Accepted for publication

Published

Publications