CFP last date
20 June 2024
Reseach Article

Low Truncation Error and Area Efficient Multiplier for Cryptographic Applications

by G. Umamaheswari, S. Shivkumar, R. Deepika
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 66 - Number 5
Year of Publication: 2013
Authors: G. Umamaheswari, S. Shivkumar, R. Deepika
10.5120/11083-6027

G. Umamaheswari, S. Shivkumar, R. Deepika . Low Truncation Error and Area Efficient Multiplier for Cryptographic Applications. International Journal of Computer Applications. 66, 5 ( March 2013), 32-38. DOI=10.5120/11083-6027

@article{ 10.5120/11083-6027,
author = { G. Umamaheswari, S. Shivkumar, R. Deepika },
title = { Low Truncation Error and Area Efficient Multiplier for Cryptographic Applications },
journal = { International Journal of Computer Applications },
issue_date = { March 2013 },
volume = { 66 },
number = { 5 },
month = { March },
year = { 2013 },
issn = { 0975-8887 },
pages = { 32-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume66/number5/11083-6027/ },
doi = { 10.5120/11083-6027 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:21:35.612540+05:30
%A G. Umamaheswari
%A S. Shivkumar
%A R. Deepika
%T Low Truncation Error and Area Efficient Multiplier for Cryptographic Applications
%J International Journal of Computer Applications
%@ 0975-8887
%V 66
%N 5
%P 32-38
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Multipliers play a vital role in many cryptographic applications like elliptic curve cryptography, RSA and other algorithms. The direct truncation of least significant part of the product leads to large error in the resultant product when fixed width output is the requirement. This paper proposes a truncation error minimizing logic which greatly reduces truncation error. Truncation error minimizing logic has been inserted in the least significant part of full length Baugh Wooley multiplier and Modified Booth Recoding multiplier and the results are compared. VHDL simulation shows that the truncation error is reduced up to 68% compared with direct truncated multiplier and involves lesser number of gates when compared to full length multipliers. It is also found that the total power consumed by these multipliers is only half the amount consumed by full length multiplier. Also Baugh Wooley multiplier performs better than Modified Booth Recoding multiplier.

References
  1. S. S. Kidambi, F. El-Guibaly, and A. Antoniou, "Area-efficient multipliers for digital signal processing applications," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 43, no. 2, pp. 90–95, Feb. 1996.
  2. J. M. Jou, S. R. Kuang, and R. D. Chen, "Design of low-error fixed width multipliers for DSP applications," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 46, no. 6, pp. 836–842, June. 1999.
  3. J. Fadavi-Ardekani,"MxN Booth Encoded Multiplier Generator Using Optimized Wallace trees," IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 1, no. 2, pp. 120–125, June,1993.
  4. S. J. Jou and H. H. Wang, "Fixed-width multiplier for DSP application," in Proc. IEEE Int. Symp. Comput. Design, pp. 318–322, Sept, 2000.
  5. F. Curticapean and J. Niittylahti, "A hardware efficient direct digital frequency synthesizer," in Proc. IEEE Int. Conf. Electron. , Circuits, Syst. , vol. 1, pp. 51–54,Sept 2001.
  6. A. G. M. Strollo, N. Petra, and D. D. Caro, "Dual-tree error compensation for high performance fixed-width multipliers," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 52, no. 8, pp. 501–507, Aug, 2005.
  7. M. Badghare, S. K. Mangal, R. B. Deshmukh, R. M. Patrikar "Design of Low Power Parallel Multiplier", Journal of Low Power Electronics, vol 5,pp 31-39 Number 1, April 2009.
  8. K. Z. Pekmestzi, "Complex Number Multipliers" IEEE Proceedings (Computers and Digital Technology), Vol. 136, No. 1, pp. 70-75, Jan, 1989.
  9. Y. -Y. Zhang, Z. Li, L. Yang, and S. -W. Zhang, "An efficient CSA architecture for Montgomery modular multiplication," Microprocessors and Microsystems, vol. 31, no. 7, pp. 456 – 459, Nov, 2007.
  10. C. McIvor, M. McLoone, and J. McCanny, "Modi?ed Montgomery modular multiplication and RSA exponentiation techniques," in IEEE Proceedings of Computers and Digital Techniques, vol. 151, no. 6, pp. 402 – 408, Nov. 2004.
  11. A. Tawfik,F. Eguibaly,M. Fahmi,and E. Abdel-Raheem,"A new inner product processor for FIR filter implementation ,"in IEEE Pacific Rim Conference on Communication Comp. , and Signal Proc. , Victoria ,B. C. , vol 19. pp 395-398 ,may 1996.
Index Terms

Computer Science
Information Sciences

Keywords

Fixed-width multiplier Direct truncated multiplier Baugh Wooley multiplier Modified Booth recoding multiplier Truncation error reduction logic elliptic curve cryptography