Abstract
Scalar multiplication is a very expensive operation in elliptic curve based cryptographic protocol. In this paper, we propose a modified simultaneous elliptic curve scalar multiplication algorithm using complementary recoding. The signed binary representation of an integer is obtained by simple arithmetic operations such as complement and bitwise subtraction. This is an efficient method to obtain the signed binary representation of scalar when compared to other standard methods such as NAF, MOF and JSF.
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.
