Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
