This paper is devoted to increasing of performance of digital signature algorithms based on elliptic curves over binary fields. Group operations complexity on Edwards curves are less than on Weierstrass curves and have immunity to some side channel attacks. Hence, it is interesting to search birationally equivalent curves in Edwards form for curves in Weierstrass form presented in NIST recommended curves list. It allows using operations over points on Edwards curve in intermediate computations in scalar multiplications over curves in Weierstrass form. This approach improves the performance and security of digital signature.