Abstract
Data Security is the most important issue nowadays. A lot of cryptosystems are introduced to provide security. Public key cryptosystems are most common cryptosystems used for securing data communication. Modular multiplication is the basic operation of a lot of public key cryptosystems such as RSA, Diffie-Hellman key agreement (DH), ElGamal, and ECC. Abd-el-fatah et al. introduced an enhanced architecture for computing modular multiplication of two large numbers X and Y modulo given M. In this paper, a modification on that architecture is introduced. The proposed design computes modular multiplication by scanning two bits per iteration instead of one bit. The proposed design for 1024-bit precision reduced overall time by 38% compared to the design of Abd-el-fatah et al.
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
Fattah, A., et al.: Efficient Implementation of Modular Multiplication on FPGAs Based on Sign Detection. In: Proc. 4th International Design and Test Workshop (IDT), pp. 1–6 (February 2010), http://ieeexplore.ieee.org/search/freesrchabstract.jsp?tp=&arnumber=5404160&openedRefinements3D26filter3DAND28NOT284283010803292926searchField3DSearch+All26queryText3Defficient+implementation+sign+detection
Narh Amanor, D.: Efficient Hardware Architectures for Modular Multiplication. M.S. thesis, University of Applied Sciences Offenburg, Germany (February 2005)
Nedjah, N.: A Review of Modular Multiplication Methods and Respective Hardware Implementations. Proc. Informatica 30, 111–129 (2006)
Narh Amanor, D., Paar, C., Pelzl, J., Bunimov, V., Schimmler, M.: Efficient hardware architectures for modular multiplication on FPGAs. In: Proc. International Conference on Field Programmable Logic and Applications, pp. 539–542 (2005)
MIRACL, Multi-precision Integer and Rational Arithmetic C/C++ Library, http://www.shamus.ie/ (last referenced January 20, 2011)
Xilinx, Inc. Foundation Series Software, http://www.xilinx.com (last referenced January 20, 2011)
Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory IT-22(6), 644–654 (1976)
Paniandi, A.: A Hardware Implementation of Rivest-Shamir-Adleman Co-processor or Resource Constrained Embedded Systems. M.S. thesis, University of Technology Malaysia (April 2008)
Knezevic, M.: Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods. IEEE Transactions on Computers 59(12), 1715–1721 (2010)
Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACMÂ 21(2) (February 1978)
Timing Constraints User Guide, http://www.xilinx.com/support/documentation/sw_manuals/xilinx12_3/ug612.pdf (last referenced March 20, 2011)
Virtex-5 FPGA User Guide, http://www.xilinx.com/support/documentation/user_guides/ug190.pdf (last referenced March 20, 2011)
VHDL Reference Manual, http://www.usna.edu/EE/ee462/manuals/vhdl_ref.pdf (last referenced March 20, 2011)
Tenca, A.F.: A Scalable Architecture for Modular Multiplication Based on Montgomery’s Algorithm. IEEE Transactions on Computer 52(9) (September 2003)
Pinckney, N.: Parallelized Radix-4 Scalable Montgomery Multipliers. Journal of Integrated Circuits and Systems, 28–30 (2008)
Kop, Q.K., Hung, C.Y.: Fast algorithm for modular reduction. IEE Proceedings, Computers and Digital Techniques 145, 265–271 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Nassar, M.A., El-Sayed, L.A.A. (2012). Radix-4 Modified Interleaved Modular Multiplier Based on Sign Detection. In: Meghanathan, N., Chaki, N., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. Computer Science and Engineering. CCSIT 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27308-7_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-27308-7_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27307-0
Online ISBN: 978-3-642-27308-7
eBook Packages: Computer ScienceComputer Science (R0)