A Subexponential Time Algorithm for Elliptic Curve Discrete Logarithm

1 comments

• nk_kolja 2 hours ago

  The runtime follows from a reduction to Boolean tensor contraction problem - recently claimed to be subexponential, and for now very impractical.