Dlog is Practically as Hard (or Easy) as DH – Solving Dlogs via DH Oracles on EC Standards

Dlog is Practically as Hard (or Easy) as DH – Solving Dlogs via DH Oracles on EC Standards

Assume that we have a group G of known order q, in which we want to solve discrete logarithms (dlogs). In 1994, Maurer showed how to compute dlogs in G in poly time given a Diffie-Hellman (DH) oracle in G, and an auxiliary elliptic curve ˆÊ (Fq) of smooth order. The problem of Maurer’s reduction of...

Full description

Bibliographic Details
Main Authors: Alexander May, Carl Richard Theodor Schneider
Format: Article
Language:English
Published: Ruhr-Universität Bochum 2023-08-01
Series:Transactions on Cryptographic Hardware and Embedded Systems
Subjects:
Public-Key Cryptography
Discrete Logarithm
Elliptic Curve
Diffie-Hellman
Oracles
Implementation
Online Access:https://tches.iacr.org/index.php/TCHES/article/view/11161

Internet

https://tches.iacr.org/index.php/TCHES/article/view/11161

Similar Items