2021

Books

• Karim Belabas and Henri Cohen:
  Numerical Algorithms for Number Theory: Using Pari/GP.
  Mathematical Surveys and Monographs vol. 254.
  American Mathematical Society 2021.

Habilitations/Professorial dissertations

• Damien Robert:
  Efficient algorithms for abelian varieties and their moduli spaces.
  Université de Bordeaux 2021.

Doctoral dissertations

• Élie Eid:
  On isogeny calculation by solving p-adic differential equations.
  Université de Rennes 2021.
• Jean Kieffer:
  Higher-dimensional modular equations, applications to isogeny computations and point counting.
  Université de Bordeaux 2021.
• Pavel Solomatin:
  Global Fields and Their $L$-functions.
  Universiteit Leiden 2021.

Journals

• Xavier Caruso, Élie Eid and Reynald Lercier:
  Fast computation of elliptic curve isogenies in characteristic two.
  Journal of the London Mathematical Society 104 (4), 2021, pp. 1901–1929.
• Xavier Caruso:
  A theory of residues for skew rational functions.
  Journal de l'École polytechnique — Mathématiques 8, 2021, pp. 1152–1192.
• Ronald Cramer, Léo Ducas and Benjamin Wesolowski:
  Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time.
  Journal of the ACM 68 (2), 2021, pp. 8:1–26.
• Eduardo Friedman, Fredrik Johansson and Gabriel Ramirez-Raposo:
  The minimal Fried average entropy for higher-rank Cartan actions.
  Mathematics of Computation 90 (328), 2021, pp. 973–978.
• Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski and Jens Zumbrägel:
  Computation of a 30750-Bit Binary Field Discrete Logarithm.
  Mathematics of Computation 90 (332), 2021, pp. 2997–3022.
• Markus Kirschmer, Fabien Narbonne, Christophe Ritzenthaler and Damien Robert:
  Spanning the isogeny class of a power of an ordinary elliptic curve over a finite field. Application to the number of rational points of curves of genus ≤4.
  Mathematics of Computation 91 (333), 2021, pp. 401–449.
• Christian Maire and Aurel Page:
  Codes from unit groups of division algebras over number fields.
  Mathematische Zeitschrift 298 (1–2), 2021, pp. 327–348.

Conferences

• Élie Bouscatié, Guilhem Castagnos and Olivier Sanders:
  Public Key Encryption with Flexible Pattern Matching.
  In Mehdi Tibouchi and Huaxiong Wang (editors):
  Advances in Cryptology – ASIACRYPT 2021, Part IV
  Lecture Notes in Computer Science vol. 13093.
  International Association for Cryptologic Research 2021, pp. 342–370.
• Xavier Caruso, Tristan Vaccon and Thibaut Verron:
  On FGLM Algorithms with Tate Algebras.
  In Frédéric Chyzak, George Labahn and Marc Mezzarobba (editors):
  International Symposium on Symbolic and Algebraic Computation — ISSAC 2021
  ACM, New York 2021, pp. 67–74.
• Luca de Feo, Cyprien Delpech de Saint Guilhem, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, Christophe Petit, Javier Silva and Benjamin Wesolowski:
  Séta: Supersingular Encryption from Torsion Attacks.
  In Mehdi Tibouchi and Huaxiong Wang (editors):
  Advances in Cryptology – ASIACRYPT 2021, Part IV
  Lecture Notes in Computer Science vol. 13093.
  Springer address = Cham 2021, pp. 249–278.
• Élie Eid:
  Fast computation of hyperelliptic curve isogenies in odd characteristic.
  In Frédéric Chyzak, George Labahn and Marc Mezzarobba (editors):
  International Symposium on Symbolic and Algebraic Computation — ISSAC 2021
  ACM, New York 2021, pp. 131–138.
• Fredrik Johansson:
  Calcium: Computing in Exact Real and Complex Fields.
  In Frédéric Chyzak, George Labahn and Marc Mezzarobba (editors):
  International Symposium on Symbolic and Algebraic Computation — ISSAC 2021
  ACM, New York 2021, pp. 225–232.
• Raphaël Pagès:
  Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time.
  In Frédéric Chyzak, George Labahn and Marc Mezzarobba (editors):
  International Symposium on Symbolic and Algebraic Computation — ISSAC 2021
  ACM, New York 2021, pp. 329–336.
• Alice Pellet-Mary and Damien Stehlé:
  On the hardness of the NTRU problem.
  In Mehdi Tibouchi and Huaxiong Wang (editors):
  Advances in Cryptology – ASIACRYPT 2021, Part I
  Lecture Notes in Computer Science vol. 13090.
  International Association for Cryptologic Research 2021, pp. 3–35.
• Sri Thyagarajan, Guilhem Castagnos, Fabien Laguillaumie and Giulio Malavolta:
  Efficient CCA Timed Commitments in Class Groups.
  In Yongdae Kim, Jong Kim, Giovanni Vigna and Elaine Shi (editors):
  ACM SIGSAC Conference on Computer and Communications Security — CCS '21
  ACM, New York 2021, pp. 2663–2684.