Welcome to the resource topic for 2022/1239
Title:
Improving Bounds on Elliptic Curve Hidden Number Problem for ECDH Key Exchange
Authors: Jun Xu, Santanu Sarkar, Huaxiong Wang, Lei Hu
Abstract:Elliptic Curve Hidden Number Problem (EC-HNP) was first introduced by Boneh, Halevi and Howgrave-Graham at Asiacrypt 2001. To rigorously assess the bit security of the Diffie–Hellman key exchange with elliptic curves (ECDH), the Diffie–Hellman variant of EC-HNP, regarded as an elliptic curve analogy of the Hidden Number Problem (HNP), was presented at PKC 2017. This variant can also be used for practical cryptanalysis of ECDH key exchange in the situation of side-channel attacks.
In this paper, we revisit the Coppersmith method for solving the involved modular multivariate polynomials in the Diffie–Hellman variant of EC-HNP and demonstrate that, for any given positive integer d, a given sufficiently large prime p, and a fixed elliptic curve over the prime field \mathbb{F}_p, if there is an oracle that outputs about \frac{1}{d+1} of the most (least) significant bits of the x-coordinate of the ECDH key, then one can give a heuristic algorithm to compute all the bits within polynomial time in \log_2 p. When d>1, the heuristic result \frac{1}{d+1} significantly outperforms both the rigorous bound \frac{5}{6} and heuristic bound \frac{1}{2}. Due to the heuristics involved in the Coppersmith method, we do not get the ECDH bit security on a fixed curve. However, we experimentally verify the effectiveness of the heuristics on NIST curves for small dimension lattices.
ePrint: https://eprint.iacr.org/2022/1239
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .