941 articles – 1212 references  [version française]
HAL: inria-00337753, version 2

See detailed view  BibTeX,EndNote,...
Twelfth IMA International Conference on Cryptography and Coding, Cirencester : Royaume-Uni (2009)
Available versions
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
Antoine Joux 1, Reynald Lercier 2, David Naccache 3, Emmanuel Thomé 4
(2009)

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.
1:  Parallélisme, Réseaux, Systèmes d'information, Modélisation (PRISM)
CNRS : UMR8144 – Université de Versailles Saint-Quentin-en-Yvelines
2:  Institut de Recherche Mathématique de Rennes (IRMAR)
CNRS : UMR6625 – Université de Rennes 1 – École normale supérieure de Cachan - ENS Cachan – Institut National des Sciences Appliquées (INSA) : - RENNES – Université de Rennes II - Haute Bretagne
3:  Laboratoire d'informatique de l'école normale supérieure (LIENS)
CNRS : UMR8548 – Ecole normale supérieure de Paris - ENS Paris
4:  CACAO (INRIA Lorraine - LORIA)
CNRS : UMR7503 – INRIA – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
Computer Science/Cryptography and Security
Discrete logarithm problem – Static Diffie-Hellman problem – Function Field Sieve – Number Field Sieve
Attached file list to this document: 
PDF
DLForgeV3.pdf(324.2 KB)