An integrated radix-4 modular divider/multiplier hardware architecture for cryptographic applications

International Arab Journal of Information Technology

Volumn 9, Issue 3, 2012, Pages

  Tawalbeh, Lo'ai ^a   Jararweh, Yaser ^b   Moh'd, Abidalrahman ^c  

^a JORDAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Jordan)

^b University of Arizona   (United States)

^c DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Cryptography; Finite field arithmetic; Hardware design; Number theory; Radix 4

Indexed keywords

EID: 83255162618     PISSN: 16833198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. Bajard J., Didier L., and Kornerup P., "An RNS Montgomery Modular Multiplication Algorithm," IEEE Transactions on Computers, vol.47, no.7, pp.766-776, 1998.
2. Brent R. and Kung H., "Systolic VLSI Arrays for Polynomial GCD Computation," IEEE Transactions on Computers, vol. 33, no. 8, pp. 731-736, 1984.
3. ElGamal T., "A Public Key Cryptosystem and Signature Scheme Based on Discrete Logarithms," IEEE Transactions on Information Theory, vol. 31, no. 4, pp. 469-472, 1998.
4. Gutub A., "New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n)," PhD Thesis, Oregon state University, 2002.
5. Gutub A., "Fast 160-Bits GF(P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers," International Arab Journal of Information Technology," vol. 3, no. 4, pp. 342-349, 2006.
6. Hasan M. and Bhargava V., "Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2m)," IEEE Transaction on Computers, vol. 41, no. 8, pp. 972-980, 1992.
7. Hellman M. and Difie W., "New Directions on Cryptography," IEEE Transactions Information Theory, vol. 22, pp. 644-654, 1976.
8. Itoh T. and Tsujii S., "A Fast Algorithm for Computing Multiplicative Inverses in GF(2m) using Normal Bases," Information and Computation, vol. 78, no. 3, pp.171-177, 1988.
9. Jararwah Y., "A Hardware Architecture of an Efficient Modular Division Algorithm for Cryptographic Applications," Master's Thesis, Jordan University of Science and Technology, Jordan, 2007.
10. th Symposium on Computer Arithmetic, pp. 220-227, 2003.
11. Montgomery P., "Modular Multiplication Without Trial Division," Mathematics of Computation, vol. 44, no. 170, pp.519-521, 1985.
12. Savas E., Tenca A., and Koc C., "A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)," in Proceedings of Cryptographic Hardware and Embedded Systems, USA, pp. 281-296, 2000.
13. Stallings W., Cryptography and Network Security Principles and Practices, Prentice Hall, 2005.
14. Tawalbeh L. and Tenca A., "An Algorithm and Hardware Architecture for Integrated Modular Division and Multiplication in GF(p) and GF(2n)," in Proceedings the IEEE International Conference on Application-Specific Systems, Architectures, and Processors (ASAP), pp. 247-257, 2004.
15. Tawalbeh L., Tenca A., and Koc C., "A Radix-4 Scalable Design," IEEE Potentials Magazine, vol. 24, no. 2, pp. 16-19, 2005.
16. Tenca A. and Tawalbeh L., "An Algorithm for Unified Modular Division in (GF(p) and (GF(2n)) Suitable for Cryptographic Hardware," IEE Electronics Letters, vol. 40, no. 5, pp. 304-306, 2004.
17. Tenca A., Todorov G., and Koc C., "High- Radix Design of a Scalable Modular Multiplier," in Proceedings of Cryptographic Hardware and Embedded Systems, pp.189-206, 2001.
18. Hsing-Wu C., Ming-Wu C., Shieh M., and Hwang Y., "High-Speed, Low Complexity Systolic Designs of Novel Iterative Division Algorithms in GF(2m)," IEEE Transactions on Computers, vol. 53, no. 3, pp. 375-380, 2004.