25 citations · 66 across the 10 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DM2013★ 1 cited
Computation with No Memory, and Rearrangeable Multicast Networks
Serge Burckel, Emeric Gioan, Emmanuel Thomé
We investigate the computation of mappings from a set S^n to itself with "in situ programs", that is using no extra variables than the input, and performing modifications of one co…
cs.CR2013
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux +1
In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main r…
cs.CR2013
Computing class polynomials for abelian surfaces
Andreas Enge, Emmanuel Thomé
We describe a quasi-linear algorithm for computing Igusa class polynomials of Jacobians of genus 2 curves via complex floating-point approximations of their roots. After providing…