Abstract
Modular division or inverse is fundamental in finite field arithmetic, and it widely exists in cryptosystems like elliptic curve cryptography. Shantz’s algorithm can be easily used for modular division in addition to the plus and minus methods. Nevertheless, a proof of the algorithm is in lack in the literature so far. This work presents a proof of Shantz’s algorithm by matrix transforms. Also, Lorencz’s modular inverse algorithm is innovative in applying left-shift operations, for which an analysis and an improvement are also given in this paper.
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 callMore From: DEStech Transactions on Computer Science and Engineering
Disclaimer: 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.
