Abstract
This work targets an efficient Montgomery Modular Multiplier for use in the channels of a Residue Number System (RNS). It is implemented on FPGA and optimized by attempting and evaluating the high radix techniques of the Montgomery Algorithm. The usual correction shift step at the end is proved to be infeasible. The resulting multiplier achieves 15ns for a modular multiplication using high radix without correction shift.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Omondi, A., Premkumar, B.: Residue Number Systems – Theory and Implementation, ser. Advances in Computer Science and Engineering: Texts, vol. 2. Imperial College Press, UK (2007)
Barraclough, S.R.: The Design and Implementation of the IMS A110 Image and Signal Processor. In: Proc. IEEE CICC, San Diego, pp. 24.5/1-4 (1989)
Bajard, J.C., Imbert, L.: A full RNS implementation of RSA. IEEE Trans. Comput. 53(6) (June 2004)
Parhami, B.: Computer Arithmetic – Algorithms and Hard-ware Designs. Oxford University Press, Oxford (2000)
Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
Soderstrand, M.A., Jenkins, W., Jullien, G.: Residue number system arithmetic: Modern applications. Digital Signal Processing (1986)
Shand, M., Vuillemin, J.: Fast Implementations of RSA Cryptography. In: Proceedings 11th IEEE Symposium on Computer Arithmetic, pp. 252–259. IEEE Computer Society Press, Los Alamitos (1993)
Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation 44(170), 519–521 (1985)
Walter, C.D.: Still faster modular multiplication. Electronics Letters 31(4), 263–264 (1995)
Takagi, N.: A Radix-4 Modular Multiplication Hardware Algorithm for Modular Exponentiation. IEEE Transactions on Computers 41(8), 949–956 (1992)
Kouretas, I., Paliouras, V.: A low-complexity high-radix RNS multiplier. IEEE Transactions on Circuits and Systems Part I 56(11), 2449–2462 (2009)
Orup, H.: Simplifying quotient determination in high-radix modular multiplication. In: Proceedings of the 12th IEEE Symposium on Computer Arithmetic, pp. 193–199 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kong, Y. (2011). High Radix Montgomery Multipliers for Residue Arithmetic Channels on FPGAs. In: Zeng, D. (eds) Future Intelligent Information Systems. Lecture Notes in Electrical Engineering, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19706-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-19706-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19705-5
Online ISBN: 978-3-642-19706-2
eBook Packages: EngineeringEngineering (R0)