Cécile Pierrot

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms

2022 · Advances in Mathematics of Communications

Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by several groups is to use this …

High-Order Galois Automorphisms for TNFS Linear Algebra

2026 · HAL (Le Centre pour la Communication Scientifique Directe)

The Number Field Sieve algorithm and its variants are the best known algorithms to solve the discrete logarithm problem in finite fields. When the extension degree is composite, the Tower variant TNFS is the most …