5 citations · 11 across the 5 of their papers we have counts for
5 papers
Bloomier Filters: A second look
Denis Charles, Kumar Chellapilla
A Bloom filter is a space efficient structure for storing static sets, where the space efficiency is gained at the expense of a small probability of false-positives. A Bloomier fil…
The hardness of computing an eigenform
Eric Bach, Denis Charles
In this article, we give evidence that computing Fourier coefficients of the Hecke eigenforms for composite indices is no easier than factoring integers. In particular, we show tha…
On the existence of distortion maps on ordinary elliptic curves
Denis Charles
Distortion maps allow one to solve the Decision Diffie-Hellman problem on subgroups of points on the elliptic curve. In the case of ordinary elliptic curves over finite fields, it…
Complex Multiplication Tests for Elliptic Curves
Denis Charles
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem…
Computing Modular Polynomials
Denis Charles, Kristin Lauter
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many a…