Abstract

Modular multiplication is basic operation in public key cryptosystems like RSA. Montgomery modular multiplication being efficient is widely used. It is based on additions and shift operations. Each iteration requires a right shift, therefore in a word based architecture a complete word is not formed at end of iteration. This paper presents compute early word based scalable Montgomery architecture. It computes the most significant bit of word by applying 2 XOR operations. Also compute early scheme for common multiplicand Montgomery is proposed. Both the architectures are compared with previous architectures in literature.

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 call

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.