Abstract
The Frobenius expansion is a method to speed up scalar multiplication on elliptic curves. Nigel Smart gave a Frobenius expansion method for elliptic curves defined over odd prime fields. Gallant, Lambert and Vanstone suggested that efficiently computable endomorphisms other than Frobenius endomorphisms can be used for fast scalar multiplication. In this paper we show that these two kinds of endomorphisms can be used together for a certain class of curves, and we present a new expansion method for elliptic curves over odd prime fields. Our experimental results show that the throughputs of the known scalar multiplication algorithms are improved by 7.6 ~ 17.3% using the new expansion method.KeywordsElliptic Curve CryptosystemScalar MultiplicationFrobenius ExpansionEndomorphism
Sign-in/Register to access full text options 
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.
