HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download

Contributor : Emmanuel Thomé Connect in order to contact the contributor
Submitted on : Tuesday, November 17, 2009 - 10:52:01 PM
Last modification on : Friday, May 20, 2022 - 9:04:43 AM
Long-term archiving on: : Saturday, November 26, 2016 - 2:33:55 PM


Files produced by the author(s)



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⟩



Record views


Files downloads