Nombre de documents

22

CV de Jérémie Detrey


Pré-publication, Document de travail3 documents

  • Masahiro Ishii, Jérémie Detrey, Pierrick Gaudry, Atsuo Inomata, Kazutoshi Fujikawa. Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM. 2016. <hal-01299697>
  • Jérémie Detrey. FFS Factory: Adapting Coppersmith's "Factorization Factory" to the Function Field Sieve. 2014. <hal-01002419>
  • Florent De Dinechin, Jérémie Detrey, Octavian Creţ, Radu Tudoran. When FPGAs are better at floating-point than microprocessors. 2007. <ensl-00174627>

Communication dans un congrès11 documents

  • Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, et al.. Discrete logarithm in GF($2^{809}$) with FFS. Hugo Krawczyk. PKC 2014 - International Conference on Practice and Theory of Public-Key Cryptography, 2014, Buenos Aires, Argentina. Springer, 2014, LNCS. <10.1007/978-3-642-54631-0_13>. <hal-00818124v3>
  • Jérémie Detrey, Pierrick Gaudry, Marion Videau. Relation collection for the Function Field Sieve. Alberto Nannarelli and Peter-Michael Seidel and Ping Tak Peter Tang. ARITH 21 - 21st IEEE International Symposium on Computer Arithmetic, Apr 2013, Austin, Texas, United States. IEEE, pp.201-210, 2013, ARITH 21. <10.1109/ARITH.2013.28>. <hal-00736123v2>
  • Diego Aranha, Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals. Optimal Eta pairing on supersingular genus-2 binary hyperelliptic curves. Orr Dunkelman. Cryptographer's Track at the RSA Conference 2012 (CT-RSA 2012), Feb 2012, San Francisco, United States. Springer, pp.19, 2012. <inria-00540002>
  • Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann. Finding Optimal Formulae for Bilinear Maps. Ferruh Özbudak and Francisco Rodríguez-Henríquez. International Workshop of the Arithmetics of Finite Fields, Jul 2012, Bochum, Germany. 7369, 2012, Lecture Notes in Computer Science. <10.1007/978-3-642-31662-3_12>. <hal-00640165v2>
  • Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, et al.. Ballot stuffing in a postal voting system. Revote 2011 - International Workshop on Requirements Engineering for Electronic Voting Systems, 2011, Trento, Italy. IEEE, pp.27 - 36, 2011, <10.1109/REVOTE.2011.6045913>. <inria-00612418>
  • Jérémie Detrey, Guillaume Hanrot, Xavier Pujol, Damien Stehlé. Accelerating lattice reduction with FPGAs. Michel Abdalla and Paulo S. L. M. Barreto. First International Conference on Cryptology and Information Security in Latin America (LATINCRYPT'10), Aug 2010, Puebla, Mexico. 6212, pp.124-143, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-14712-8_8>. <inria-00539929>
  • Jérémie Detrey, Pierrick Gaudry, Karim Khalfallah. A low-area yet performant FPGA implementation of Shabal. Alex Biryukov and Guang Gong and Douglas Stinson. 17th International Workshop on Selected Areas in Cryptography, SAC 2010, Aug 2010, Waterloo, Canada. Springer, 6544, pp.99-113, 2011, Lecture Notes in Computer Science; Selected Areas in Cryptography 17th International Workshop, SAC 2010 Revised Selected Papers. <10.1007/978-3-642-19574-7_7>. <inria-00498705>
  • Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals, Eiji Okamoto, Francisco Rodríguez-Henríquez. Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers. Christophe Clavier and Kris Gaj. 11th International Workshop on Cryptographic Hardware and Embedded Systems - CHES 2009, Sep 2009, Lausanne, Switzerland. Springer, 5747, pp.225-239, 2009, Lecture Notes in Computer Science; Cryptographic Hardware and Embedded Systems - CHES 2009. <10.1007/978-3-642-04138-9_17>. <inria-00424011>
  • Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Francisco Rodríguez-Henríquez. A comparison between hardware accelerators for the modified Tate pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$. Steven D. Galbraith and Kenneth G. Paterson. Second International Conference on Pairing-Based Cryptography – Pairing 2008, Sep 2008, Egham, United Kingdom. Springer, 5209, pp.297-315, 2008, Lecture Notes in Computer Science; Pairing-Based Cryptography – Pairing 2008. <10.1007/978-3-540-85538-5_20>. <inria-00423977>
  • Jérémie Detrey, Florent De Dinechin, Xavier Pujol. Return of the hardware floating-point elementary function. 18th Symposium on Computer Arithmetic, Jun 2007, Montpellier, France. IEEE, pp.161-168, 2007. <ensl-00117386>
  • Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto. Arithmetic Operators for Pairing-Based Cryptography. Pascal Paillier, Ingrid Verbauwhede. 9th Invernational Workshop on Cryptographic Hardware and Embedded Systems – CHES 2007, Sep 2007, Vienne, Austria. Springer, pp.239-255, 2007, LNCS 4727. <10.1007/978-3-540-74735-2_17>. <ensl-00137918>

Article dans une revue5 documents

  • Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals, Eiji Okamoto, Francisco Rodríguez-Henríquez. Fast architectures for the $\eta_T$ pairing over small-characteristic supersingular elliptic curves. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, Special Section on Computer Arithmetic, 60 (2), pp.266-281. <10.1109/TC.2010.163>. <inria-00424016v2>
  • Jérémie Detrey, Florent De Dinechin. Fonctions élémentaires en virgule flottante pour les accélérateurs reconfigurables. Techniques et Sciences Informatiquess, Editions Hermès, 2008, Architecture des Ordinateurs, 27 (6), pp.673-698. <10.3166/tsi.27.673-698>. <inria-00424001>
  • Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Masaaki Shirase, et al.. Algorithms and arithmetic operators for computing the $\eta_T$ pairing in characteristic three. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2008, Special Section on Special-Purpose Hardware for Cryptography and Cryptanalysis, 57 (11), pp.1454-1468. <10.1109/TC.2008.103>. <inria-00423993>
  • Florent De Dinechin, Jérémie Detrey. A Tool for Unbiased Comparison between Logarithmic and Floating-point Arithmetic. Journal of VLSI Signal Processing / J VLSI Sign Process Syst Sign Image Video Technol, Kluwer Academic Publishers, 2007, 49 (1), pp.161-175. <10.1007/s11265-007-0048-7>. <ensl-00542212>
  • Florent De Dinechin, Jérémie Detrey. Parameterized floating-point logarithm and exponential functions for FPGAs. Microprocessors and Microsystems: Embedded Hardware Design (MICPRO), Elsevier, 2006, 31 (8), pp.537-545. <10.1016/j.micpro.2006.02.008>. <ensl-00542213>

Document associé à des manifestations scientifiques1 document

  • Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann. Finding Optimal Formulae for Bilinear Maps. AriC Seminar, Mar 2012, Lyon, France. <hal-01413162>

Rapport2 documents

  • Jérémie Detrey, Florent De Dinechin. Second Order Function Approximation with a Single Small Multiplication. [Research Report] RR-5140, INRIA. 2004. <inria-00071443>
  • Jérémie Detrey, Florent De Dinechin. Multipartite Tables in JBits for the Evaluation of Functions on FPGA. [Research Report] RR-4305, INRIA. 2001. <inria-00072282>