An optimised architecture for radix-2 Montgomery modular multiplication on FPGA Online publication date: Mon, 13-Feb-2012
by Mohamed Issad; Mohamed Anane; Nadjia Anane
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 3, No. 4, 2011
Abstract: In this paper, the algorithm and the hardware implementation of radix-2 Montgomery modular multiplication (MMM) are presented. The operation's performances depend on the radix and the modulus size. The MMM with big modulus requires a large area for its implementation. The objective of this work is to realise an optimised intellectual property (IP) to perform this operation with a reduced area, independent of the modulus size, dedicated to low rate cryptographic applications. Our architecture uses a fixed data path size w to compute the MMM of two n-bits operands, with n >> w. To store these operands, we use embedded memory blocks (SelectRam), instead of long registers to overcome the routing complexity which is a timing consumer. The arithmetic unit (AU) is optimised at the low level (CLB), resulting in high performances AU. The proposed architecture is suitable to hybrid cryptosystem where both the symmetric and asymmetric cryptographies are used.
Online publication date: Mon, 13-Feb-2012
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com