In 2004, an algorithm is introduced to solve the DLP for elliptic curves defined over a non prime finite field Fqn . One of the main steps of this algorithm requires decomposing points of the curve E(Fqn ) with respect to a factor base, this problem is denoted PDP. In this paper, we will apply this algorithm to the case of Edwards curves, the well known family of elliptic curves that allow faster arithmetic as shown by Bernstein and Lange. More precisely, we show how to take advantage of some symmetries of twisted Edwards and twisted Jacobi intersections curves to gain an exponential factor 23(n1) to solve the corresponding PDP. Practical experiments supporting the theoretical result are also given. For instance, the complexity of solving the ECDLP for twisted Edwards curves defined over Fq5 , with q 264, is supposed to be 2160 operations in E(Fq5 ) using generic algorithms compared to 2127 operations (multiplication of two 32 bits words) with our method. For these parameters the PDP is untractable with the original algorithm. The main tool to achieve these results relies on the use of the symmetries during the polynomial system solving step. Also, we use a recent work on a new strategy for the change of ordering of Gr¨obner basis which provides a better heuristic complexity of the total solving process.