Abstract
A B S T R A C T An efficient precomputation-based generic-point parallel scalar multiplication method is presented in this study. The proposed method takes a set of generic points and performs their precomputations concurrently using an equivalent set of elliptic curve cryptoprocessors. Then, parallel scalar multiplications are performed sequentially for each of the generic points. The new method outperforms the existing postcomputation-based methods. Furthermore, it is scalable for any number of parallel processors and performs better as the number of consecutive requests increases. The proposed method has been implemented on an FPGA and its Area-Time 2 (AT 2 ) performance metric outperformed recent fast implementations.
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.
