An elliptic curves cryptosystem is cryptography which guarantee safety in public key cryptosystem.When we use index calculus, one of methods of solving Elliptic curves cryptography, the most dominant part is solving polynomial. We experimentally evaluate how efficiently this polynomial can be solved using a set method. The set method to introduce is a method of dividing it by a binary tree.