High Saturation Complete Graph Approach for EC Point Decomposition and ECDL Problem


One of the key questions in contemporary applied cryptography is whether there exist an efficient algorithm for solving the discrete logarithm problem in elliptic curves. The primary approach for this problem is to try to solve a certain system of polynomial equations [44]. Current attempts try to solve them directly with existing software tools which does… (More)


10 Figures and Tables

Slides referencing similar topics