Simon Abelard

13 papers B 2Journal 10
YearRankTypeTitle / Venue / Authors
2024 J jnl
Broadcast Encryption using Sum-Product decomposition of Boolean functions.
IACR Commun. Cryptol.
Aurélien Dupin, Simon Abelard
2024 J jnl
Broadcast Encryption using Sum-Product decomposition of Boolean functions.
IACR Cryptol. ePrint Arch.
Aurélien Dupin, Simon Abelard
2024 J jnl
Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities.
Appl. Algebra Eng. Commun. Comput.
Simon Abelard, Alain Couvreur, Grégoire Lecerf
2022 J jnl
Computing Riemann-Roch spaces via Puiseux expansions.
J. Complex.
Simon Abelard, Elena Berardini, Alain Couvreur, Grégoire Lecerf
2020 J jnl
Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus.
J. Complex.
Simon Abelard
2020 B conf
On the Complexity of Computing Integral Bases of Function Fields.
CASC
Simon Abelard
2020 J jnl
On the complexity of computing integral bases of function fields.
CoRR
Simon Abelard
2020 B conf
Sub-quadratic time for riemann-roch spaces: case of smooth divisors over nodal plane projective curves.
ISSAC
Simon Abelard, Alain Couvreur, Grégoire Lecerf
2019 J jnl
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves.
Found. Comput. Math.
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
2018 J jnl
Counting points on genus-3 hyperelliptic curves with explicit real multiplication.
CoRR
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
2018 — —
Counting points on hyperelliptic curves in large characteristic : algorithms and complexity. (Comptage de points de courbes hyperelliptiques en grande caractéristique : algorithmes et complexité).
Simon Abelard
2018 J jnl
Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus.
CoRR
Simon Abelard
2017 J jnl
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves.
CoRR
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer