Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jérémie Detrey
2010 – today
- 2013
[i10]Jérémie Detrey, Pierrick Gaudry, Marion Videau: Relation collection for the Function Field Sieve. IACR Cryptology ePrint Archive 2013: 71 (2013)
[i9]Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann: Discrete logarithm in GF(2^809) with FFS. IACR Cryptology ePrint Archive 2013: 197 (2013)- 2012
[c16]Diego F. Aranha, Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals: Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves. CT-RSA 2012: 98-115
[c15]Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann: Finding Optimal Formulae for Bilinear Maps. WAIFI 2012: 168-186
[i8]Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann: Finding Optimal Formulae for Bilinear Maps. IACR Cryptology ePrint Archive 2012: 110 (2012)- 2011
[j6]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 Trans. Computers 60(2): 266-281 (2011)
[c14]Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann: Ballot stuffing in a postal voting system. REVOTE 2011: 27-36- 2010
[c13]Jérémie Detrey, Guillaume Hanrot, Xavier Pujol, Damien Stehlé: Accelerating Lattice Reduction with FPGAs. LATINCRYPT 2010: 124-143
[c12]Jérémie Detrey, Pierrick Gaudry, Karim Khalfallah: A Low-Area Yet Performant FPGA Implementation of Shabal. Selected Areas in Cryptography 2010: 99-113
[i7]Jérémie Detrey, Pierrick Gaudry, Karim Khalfallah: A Low-Area yet Performant FPGA Implementation of Shabal. IACR Cryptology ePrint Archive 2010: 292 (2010)
[i6]Diego F. Aranha, Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals: Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves. IACR Cryptology ePrint Archive 2010: 559 (2010)
2000 – 2009
- 2009
[c11]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. CHES 2009: 225-239
[i5]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. IACR Cryptology ePrint Archive 2009: 122 (2009)
[i4]Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals, Eiji Okamoto, Francisco Rodríguez-Henríquez: Fast Architectures for the etaT Pairing over Small-Characteristic Supersingular Elliptic Curves. IACR Cryptology ePrint Archive 2009: 398 (2009)- 2008
[j5]Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Masaaki Shirase, Tsuyoshi Takagi: Algorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three. IEEE Trans. Computers 57(11): 1454-1468 (2008)
[j4]Jérémie Detrey, Florent de Dinechin: Fonctions élémentaires en virgule flottante pour les accélérateurs reconfigurables. Technique et Science Informatiques 27(6): 673-698 (2008)
[c10]Florent de Dinechin, Jérémie Detrey, Octavian Cret, Radu Tudoran: When FPGAs are better at floating-point than microprocessors. FPGA 2008: 260
[c9]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 F2m and F3m. Pairing 2008: 297-315
[i3]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 F2m and F3m. IACR Cryptology ePrint Archive 2008: 115 (2008)- 2007
[j3]Jérémie Detrey, Florent de Dinechin: Parameterized floating-point logarithm and exponential functions for FPGAs. Microprocessors and Microsystems 31(8): 537-545 (2007)
[j2]Jérémie Detrey, Florent de Dinechin: A Tool for Unbiased Comparison between Logarithmic and Floating-point Arithmetic. VLSI Signal Processing 49(1): 161-175 (2007)
[c8]Jérémie Detrey, Florent de Dinechin, Xavier Pujol: Return of the hardware floating-point elementary function. IEEE Symposium on Computer Arithmetic 2007: 161-168
[c7]Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto: Arithmetic Operators for Pairing-Based Cryptography. CHES 2007: 239-255
[c6]Jérémie Detrey, Florent de Dinechin: Floating-Point Trigonometric Functions for FPGAs. FPL 2007: 29-34
[i2]Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto: Arithmetic Operators for Pairing-Based Cryptography. IACR Cryptology ePrint Archive 2007: 91 (2007)
[i1]Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Masaaki Shirase, Tsuyoshi Takagi: Algorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three. IACR Cryptology ePrint Archive 2007: 417 (2007)- 2006
[c5]Sylvain Collange, Jérémie Detrey, Florent de Dinechin: Floating Point or LNS: Choosing the Right Arithmetic on an Aapplication Basis. DSD 2006: 197-203- 2005
[j1]Jérémie Detrey, Florent de Dinechin: Outils pour une comparaison sans a priori entre arithmétique logarithmique et arithmétique flottante. Technique et Science Informatiques 24(6): 625-643 (2005)
[c4]Jérémie Detrey, Florent de Dinechin: Table-based polynomials for fast hardware function evaluation. ASAP 2005: 328-333
[c3]Jérémie Detrey, Florent de Dinechin: A Parameterized Floating-Point Exponential Function for FPGAs. FPT 2005: 27-34- 2004
[c2]Jérémie Detrey, Florent de Dinechin: Second Order Function Approximation Using a Single Multiplication on FPGAs. FPL 2004: 221-230- 2002
[c1]Jérémie Detrey, Florent de Dinechin: Multipartite Tables in JBits for the Evaluation of Functions on FPGAs. IPDPS 2002
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-13 21:40 CEST by the dblp team



