Recherche - Archive ouverte HAL Accéder directement au contenu

Filtrer vos résultats

59 résultats
Page :
triés par
Image document

Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation

 Aurore Guillevic , Simon Masson , Emmanuel Thomé
Designs, Codes and Cryptography, 2020, 88 (6), pp.1047-1081. ⟨10.1007/s10623-020-00727-w⟩
Article dans une revue hal-02305051v2
Image document

Computation with No Memory, and Rearrangeable Multicast Networks

 Emeric Gioan , Serge Burckel , Emmanuel Thomé
Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 1 (1), pp.121-142. ⟨10.46298/dmtcs.638⟩
Article dans une revue lirmm-00959964v1
Image document

Discrete logarithm in GF($2^{809}$) with FFS

 Razvan Barbulescu , Cyril Bouvier , Jérémie Detrey , Pierrick Gaudry , Hamza Jeljeli , et al.
Public-Key Cryptography – PKC 2014, 2014, Buenos Aires, Argentina. ⟨10.1007/978-3-642-54631-0_13⟩
Communication dans un congrès hal-00818124v3
Image document

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

 Jean-Guillaume Dumas , Erich Kaltofen , Emmanuel Thomé , Gilles Villard
ISSAC’2016, Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. pp.199-206, ⟨10.1145/2930889.2930908⟩
Communication dans un congrès hal-01266041v3
Image document

New Discrete Logarithm Computation for the Medium Prime Case Using the Function Field Sieve

 Madhurima Mukhopadhyay , Palash Sarkar , Shashank Singh , Emmanuel Thomé
Advances in Mathematics of Communications, 2022, 16 (3), pp.449-464. ⟨10.3934/amc.2020119⟩
Article dans une revue hal-02964002v1

Function Field Sieve

 Emmanuel Thomé
Henk C. A. van Tilborg and Sushil Jajodia. Encyclopedia of Cryptography and Security, Springer, pp.501-502, 2011, 978-1-4419-5905-8. ⟨10.1007/978-1-4419-5906-5_450⟩
Chapitre d'ouvrage hal-00942002v1
Image document

Using a grid platform for solving large sparse linear systems over GF(2)

 Thorsten Kleinjung , Lucas Nussbaum , Emmanuel Thomé
11th ACM/IEEE International Conference on Grid Computing – Grid 2010, Oct 2010, Brussels, Belgium. ⟨10.1109/GRID.2010.5697952⟩
Communication dans un congrès inria-00502899v1
Image document

Factorization of a 768-bit RSA modulus

 Thorsten Kleinjung , Kazumaro Aoki , Jens Franke , Arjen K. Lenstra , Emmanuel Thomé , et al.
Advances in Cryptology – CRYPTO 2010, Aug 2010, Santa Barbara, United States. pp.333-350, ⟨10.1007/978-3-642-14623-7_18⟩
Communication dans un congrès inria-00444693v2
Image document

Computing class polynomials for abelian surfaces

 Andreas Enge , Emmanuel Thomé
Experimental Mathematics, 2014, 23 (2), pp.129-145. ⟨10.1080/10586458.2013.878675⟩
Article dans une revue hal-00823745v2
Image document

Root optimization of polynomials in the number field sieve

 Shi Bai , Richard Brent , Emmanuel Thomé
Mathematics of Computation, 2015, 84 (295), pp.2447-2457. ⟨10.1090/S0025-5718-2015-02926-3⟩
Article dans une revue hal-00919367v1
Image document

Computing theta functions in quasi-linear time in genus 2 and above

 Hugo Labrande , Emmanuel Thomé
LMS Journal of Computation and Mathematics, 2016, Special issue: Algorithmic Number Theory Symposium XII, 19 (A), pp.163-177. ⟨10.1112/S1461157016000309⟩
Article dans une revue hal-01277169v1
Image document

Computing discrete logarithms in $GF(p^6)$

 Laurent Grémy , Aurore Guillevic , François Morain , Emmanuel Thomé
Selected Areas in Cryptography – SAC 2017, Aug 2017, Ottawa, Canada. pp.85-105, ⟨10.1007/978-3-319-72565-9_5⟩
Communication dans un congrès hal-01624662v1

RSA : la fin des clés de 768 bits

 Pierrick Gaudry , Emmanuel Thomé , Paul Zimmermann
Techniques de l'Ingénieur, 2011, IN131, ⟨10.51257/a-v1-in131⟩
Article dans une revue hal-00641592v1

Sieving in Function Fields

 Emmanuel Thomé
Henk C. A. van Tilborg and Sushil Jajodia. Encyclopedia of Cryptography and Security, Springer, pp.1205-1206, 2011, 978-1-4419-5905-8. ⟨10.1007/978-1-4419-5906-5_476⟩
Chapitre d'ouvrage hal-00942003v1
Image document

A kilobit hidden SNFS discrete logarithm computation

 Joshua Fried , Pierrick Gaudry , Nadia Heninger , Emmanuel Thomé
Advances in Cryptology – EUROCRYPT 2017, Apr 2017, Paris, France. pp.202-231, ⟨10.1007/978-3-319-56620-7_8⟩
Communication dans un congrès hal-01376934v2
Image document

Factorisation of RSA-220 with CADO-NFS

 Shi Bai , Pierrick Gaudry , Alexander Kruppa , Emmanuel Thomé , Paul Zimmermann
2016
Pré-publication, Document de travail hal-01315738v1
Image document

Théorie algorithmique des nombres et applications à la cryptanalyse de primitives cryptographiques

 Emmanuel Thomé
Cryptographie et sécurité [cs.CR]. Université de Lorraine, 2012
HDR tel-00765982v2
Image document

A modified block Lanczos algorithm with fewer vectors

 Emmanuel Thomé
Joppe W. Bos; Arjen K. Lenstra. Topics in Computational Number Theory inspired by Peter L. Montgomery, Cambridge University Press, pp.175-188, 2017, 978-1-107-10935-3. ⟨10.1017/9781316271575.008⟩
Chapitre d'ouvrage hal-01293351v1
Image document

Square root algorithms for the number field sieve

 Emmanuel Thomé
Arithmetic of Finite Fields -- WAIFI 2012, Jul 2012, Bochum, Germany. pp.208-224, ⟨10.1007/978-3-642-31662-3_15⟩
Communication dans un congrès hal-00756838v1

Computing Discrete Logarithms in Small Characteristic Finite Fields in Quasi-Polynomial Time

 Emmanuel Thomé
The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France
Communication dans un congrès hal-01276702v1
Image document

Mapping Computation with No Memory

 Serge Burckel , Emeric Gioan , Emmanuel Thomé
UC 2009: Unconventional Computation, Sep 2009, Ponta Delgada, Portugal. pp.85-97, ⟨10.1007/978-3-642-03745-0_15⟩
Communication dans un congrès lirmm-00395080v1
Image document

Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm

 Emmanuel Thomé
Journal of Symbolic Computation, 2002, 33 (5), pp.757-775. ⟨10.1006/jsco.2002.0533⟩
Article dans une revue inria-00103417v1
Image document

Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm

 Emmanuel Thomé
ISSAC '01: Proceedings of the 2001 international symposium on Symbolic and algebraic computation, Jul 2001, London, Ontario, Canada. pp.323-331, ⟨10.1145/384101.384145⟩
Communication dans un congrès inria-00517999v1
Image document

A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic

 Razvan Barbulescu , Pierrick Gaudry , Antoine Joux , Emmanuel Thomé
Advances in Cryptology -- EUROCRYPT 2014, May 2014, Copenhagen, Denmark. pp.1-16, ⟨10.1007/978-3-642-55220-5_1⟩
Communication dans un congrès hal-00835446v2
Image document

Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices

 Jean-Guillaume Dumas , Erich Kaltofen , Emmanuel Thomé
[Research Report] Université Grenoble Alpes (UGA). 2015
Rapport hal-01171249v1
Image document

Software Evaluation

 Anne Canteaut , Miguel Angel Fernández , Luc Maranget , Sophie Perin , Mario Ricchiuto , et al.
[Research Report] Inria. 2021
Rapport hal-03110728v1

A Heterogeneous Computing Environment to Solve the 768-bit RSA Challenge

 Thorsten Kleinjung , Joppe W. Bos , Arjen K. Lenstra , Dag Arne Osvik , Kazumaro Aoki , et al.
Cluster Computing, 2012, 15 (1), pp.53-68. ⟨10.1007/s10586-010-0149-0⟩
Article dans une revue inria-00535765v1
Image document

Bilan de la mandature 2019-2023 de la Commission d'Évaluation Inria

 Anne Canteaut , Manuel Serrano , Céline Grandmont , Guillaume Pallez , Vincent Perrier , et al.
Inria. 2023
Rapport hal-04193082v1
Image document

History of Cryptographic Key Sizes

 Nigel P Smart , Emmanuel Thomé
Joppe Bos; Martijn Stam. Computational Cryptography, 469, Cambridge University Press, 2021, London Mathematical Society Lecture Note Series, 9781108795937
Chapitre d'ouvrage hal-03408015v1
Image document

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction

 Aurore Guillevic , François Morain , Emmanuel Thomé
Selected Areas in Cryptography -- SAC 2016, Aug 2016, St. Johns, Newfoundland, Canada. pp.559-578, ⟨10.1007/978-3-319-69453-5_30⟩
Communication dans un congrès hal-01320496v2
Page :