Welcome to the resource topic for 2015/986
Title:
Bit Coincidence Mining Algorithm
Authors: Koh-ichi Nagao
Abstract:Here, we propose new algorithm for solving ECDLP named “Bit Coincidence Mining Algorithm!”, from which ECDLP is reduced to solving some quadratic equations system. In this algorithm, ECDLP of an elliptic curve E defined over \bF_q (q is prime or power of primes) reduces to solving quadratic equations system of d-1 variables and d+C_0-1 equations where C_0 is small natural number and d \sim C_0 \, \log_2 q. This equations system is too large and it can not be solved by computer. However, we can show theoritically the cost for solving this equations system by xL algorithm is subexponential under the reasonable assumption of xL algorithm.
ePrint: https://eprint.iacr.org/2015/986
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 .