Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms

Abstract

This paper extends Joux-Naccache-Thomé's e-th root algorithm to the static Diffie-Hellman problem (sdhp). The new algorithm can be adapted to diverse finite fields by customizing it with an nfs-like core or an ffs-like core. In both cases, after a number of sdhp oracle queries, the attacker builds-up the ability to solve new sdhp instances unknown before the query phase. While sub-exponential, the algorithm is still significantly faster than all currently known dlp and sdhp resolution methods. We explore the applicability of the technique to various cryptosystems. The attacks were implemented in F_{2^1025} and also in F_p, for a 516-bit p.
Fichier principal
Vignette du fichier
DLForgeV3.pdf (286.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00337753 , version 1 (08-11-2008)
inria-00337753 , version 2 (17-11-2009)

Identifiers

Cite

Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé. Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. Cryptography and Coding -- IMACC 2009, Dec 2009, Cirencester, United Kingdom. pp.351-367, ⟨10.1007/978-3-642-10868-6_21⟩. ⟨inria-00337753v2⟩
501 View
315 Download

Altmetric

Share

Gmail Facebook X LinkedIn More