Breaking Randomized Mixed-Radix Scalar Multiplication Algorithms

Autor: Laurent Imbert, Jérémie Detrey

Publikováno v: Progress in Cryptology – LATINCRYPT 2019 ISBN: 9783030305291
LATINCRYPT
LATINCRYPT 2019-6th International Conference on Cryptology and Information Security in Latin America
LATINCRYPT 2019-6th International Conference on Cryptology and Information Security in Latin America, Oct 2019, Santiago de Chile, Chile. pp.24-39, ⟨10.1007/978-3-030-30530-7_2⟩

International audience; In this paper we present a novel, powerful attack on a recently introduced randomized scalar multiplication algorithm based on covering systems of congruences. Our attack can recover the whole key with very few traces, even wh

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3cd410cfe54cde06dcd011f490cd9d01
https://doi.org/10.1007/978-3-030-30530-7_2

Parameterized floating-point logarithm and exponential functions for FPGAs

Autor: Jérémie Detrey, Florent de Dinechin

Publikováno v: Microprocessors and Microsystems: Embedded Hardware Design
Microprocessors and Microsystems: Embedded Hardware Design, 2006, 31 (8), pp.537-545. ⟨10.1016/j.micpro.2006.02.008⟩
Microprocessors and Microsystems: Embedded Hardware Design (MICPRO)
Microprocessors and Microsystems: Embedded Hardware Design (MICPRO), Elsevier, 2006, 31 (8), pp.537-545. ⟨10.1016/j.micpro.2006.02.008⟩

International audience; As FPGAs are increasingly being used for floating-point computing, the feasibility of a library of floating-point elementary functions for FPGAs is discussed. An initial implementation of such a library contains parameterized

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f675012ba2c39ff8ecea2d14aee8aef
https://doi.org/10.1016/j.micpro.2006.02.008

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

Autor: Pierrick Gaudry, Jérémie Detrey, Razvan Barbulescu, Emmanuel Thomé, Marion Videau, Paul Zimmermann, Cyril Bouvier, Hamza Jeljeli

Publikováno v: International Workshop on Public Key Cryptography
Public-Key Cryptography – PKC 2014
Public-Key Cryptography – PKC 2014, 2014, Buenos Aires, Argentina. ⟨10.1007/978-3-642-54631-0_13⟩
Public-Key Cryptography – PKC 2014 ISBN: 9783642546303
Public Key Cryptography

International audience; The year 2013 has seen several major complexity advances for the discrete logarithm problem in multiplicative groups of small- characteristic finite fields. These outmatch, asymptotically, the Function Field Sieve (FFS) approa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::927460678ee9ff557a7c0bd114c06d8d
https://inria.hal.science/hal-00818124

Recherche automatique de formules pour calculer des formes bilinéaires

Autor: Razvan Barbulescu, Jérémie Detrey, Paul Zimmermann, Nicolas Estibals

Publikováno v: AriC Seminar
AriC Seminar, Mar 2012, Lyon, France
International Workshop of the Arithmetics of Finite Fields
International Workshop of the Arithmetics of Finite Fields, Ruhr Universitat Bochum, Jul 2012, Bochum, Germany. ⟨10.1007/978-3-642-31662-3_12⟩
Arithmetic of Finite Fields ISBN: 9783642316616
WAIFI

National audience; This talk will focus on the bilinear rank problem: given a bilinear map (e.g., the product of polynomials, of finite-field elements, or of matrices), what is the smallest number of multiplications over the coefficient ring required

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2462ee81a89c77fa553a141ed078a20d
https://hal.inria.fr/hal-01413162/file/talk.pdf

Fast architectures for the $\eta_T$ pairing over small-characteristic supersingular elliptic curves

Autor: Nicolas Estibals, Jérémie Detrey, Eiji Okamoto, Francisco Rodríguez-Henríquez, Jean-Luc Beuchat

Publikováno v: IEEE Transactions on Computers
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⟩
IEEE Transactions on Computers, 2011, Special Section on Computer Arithmetic, 60 (2), pp.266-281. ⟨10.1109/TC.2010.163⟩

International audience; This paper is devoted to the design of fast parallel accelerators for the cryptographic $\eta_T$ pairing on supersingular elliptic curves over finite fields of characteristics two and three. We propose here a novel hardware im

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d3fb2965658c05a6c8f260fc98d6fe5
https://hal.inria.fr/inria-00424016v2/document