default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJérémie Detrey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c19]Jérémie Detrey, Laurent Imbert:
Breaking Randomized Mixed-Radix Scalar Multiplication Algorithms. LATINCRYPT 2019: 24-39- 2017
- [j7]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. IEEE Trans. Computers 66(12): 2019-2030 (2017) - 2016
- [i12]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. IACR Cryptol. ePrint Arch. 2016: 365 (2016) - 2014
- [c18]Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann:
Discrete Logarithm in GF(2809) with FFS. Public Key Cryptography 2014: 221-238 - [i11]Jérémie Detrey:
FFS Factory: Adapting Coppersmith's "Factorization Factory" to the Function Field Sieve. IACR Cryptol. ePrint Arch. 2014: 419 (2014) - 2013
- [c17]Jérémie Detrey, Pierrick Gaudry, Marion Videau:
Relation Collection for the Function Field Sieve. IEEE Symposium on Computer Arithmetic 2013: 201-210 - [i10]Jérémie Detrey, Pierrick Gaudry, Marion Videau:
Relation collection for the Function Field Sieve. IACR Cryptol. ePrint Arch. 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(2809) with FFS. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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. Tech. Sci. 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 Cryptol. ePrint Arch. 2008: 115 (2008) - 2007
- [j3]Jérémie Detrey, Florent de Dinechin:
Parameterized floating-point logarithm and exponential functions for FPGAs. Microprocess. 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. J. VLSI Signal Process. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2007: 417 (2007) - 2006
- [c5]Caroline 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. Tech. Sci. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
