Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
From MaRDI portal
Publication:3654628
DOI10.1007/978-3-642-10868-6_21zbMath1234.94050MaRDI QIDQ3654628
Emmanuel Thomé, David Naccache, Reynald Lercier, Antoine Joux
Publication date: 7 January 2010
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00337753v2/file/DLForgeV3.pdf
94A60: Cryptography
Related Items
Recent progress on the elliptic curve discrete logarithm problem, Elliptic curve discrete logarithm problem over small degree extension fields, Refined analysis to the extended tower number field sieve