Emmanuel Thomé

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix

2016 · arXiv (Cornell University)

Computational problem certificates are additional data structures for each output, which can be used by a-possibly randomized-verification algorithm that proves the correctness of each output. In this paper, we give an algorithm that computes a …

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 …