FAST INTEGER MULTIPLICATION USING GENERALIZED FERMAT PRIMES von COVANOV, SVYATOSLAV, THOMÉ, EMMANUEL

Volltext

A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic von Barbulescu, Razvan, Gaudry, Pierrick, Joux, Antoine, Thomé, Emmanuel

Volltext

Factorization of a 768-Bit RSA Modulus von Kleinjung, Thorsten, Aoki, Kazumaro, Franke, Jens, Lenstra, Arjen K., Thomé, Emmanuel, Bos, Joppe W., Gaudry, Pierrick, Kruppa, Alexander, Montgomery, Peter L., Osvik, Dag Arne, te Riele, Herman, Timofeev, Andrey, Zimmermann, Paul

Volltext

Cocks–Pinch curves of embedding degrees five to eight and optimal ate pairing computation von Guillevic, Aurore, Masson, Simon, Thomé, Emmanuel

Volltext

Isogeny graphs with maximal real multiplication von Ionica, Sorina, Thomé, Emmanuel

Volltext

Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment von Boudot, Fabrice, Gaudry, Pierrick, Guillevic, Aurore, Heninger, Nadia, Thomé, Emmanuel, Zimmermann, Paul

Volltext

Computing theta functions in quasi-linear time in genus two and above von Labrande, Hugo, Thomé, Emmanuel

Volltext

Computing Class Polynomials for Abelian Surfaces von Enge, Andreas, Thomé, Emmanuel

Volltext

Root optimization of polynomials in the number field sieve von Bai, Shi, Brent, Richard P., Thomé, Emmanuel

Volltext

Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three von Diem, Claus, Thomé, Emmanuel

Volltext

A heterogeneous computing environment to solve the 768-bit RSA challenge von Kleinjung, Thorsten, Bos, Joppe W., Lenstra, Arjen K., Osvik, Dag Arne, Aoki, Kazumaro, Contini, Scott, Franke, Jens, Thomé, Emmanuel, Jermini, Pascal, Thiémard, Michela, Leyland, Paul, Montgomery, Peter L., Timofeev, Andrey, Stockinger, Heinz

Volltext

Computation with No Memory, and Rearrangeable Multicast Networks von Gioan, Emeric, Burckel, Serge, Thomé, Emmanuel

Volltext

An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves von Enge, Andreas, Gaudry, Pierrick, Thomé, Emmanuel

Volltext

A Kilobit Hidden SNFS Discrete Logarithm Computation von Fried, Joshua, Gaudry, Pierrick, Heninger, Nadia, Thomé, Emmanuel

Volltext

Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction von Guillevic, Aurore, Morain, François, Thomé, Emmanuel

Volltext

Computation of discrete logarithms in F2607 von THOME, Emmanuel

Volltext

Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms von Joux, Antoine, Lercier, Reynald, Naccache, David, Thomé, Emmanuel

Volltext

Fast integer multiplication usinggeneralized Fermat primes von Covanov, Svyatoslav, Thomé, Emmanuel

Volltext

Mapping Computation with No Memory von Burckel, Serge, Gioan, Emeric, Thomé, Emmanuel

Volltext

Algorithmic Number Theory: 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010, Proceedings von Hanrot, Guillaume, Morain, Francois, Thomé, Emmanuel

Volltext