A Novel Binary Polynomial Multiplier Based on M-Term Karatsuba for Finite Field Computation

Authors

  • Konduri Prasanna Lakshmi  PG Scholar, Department of ECE, VEMU Institute of Technology, P.Kothakota, Andhra Pradesh, India.
  • Dr. S. Leela Lakshmi  Professor, Department of ECE, VEMU Institute of Technology, P.Kothakota, Andhra Pradesh, India.

Keywords:

Karatsuba algorithm, Finite field arithmetic, Polynomial multiplier.

Abstract

This paper presents an optimized M-term Karatsuba-like binary, polynomial multiplier for finite field arithmetic. The proposed method is based on the traditional Karatsuba algorithm but incorporates modifications to handle binary polynomials of arbitrary degree. The proposed algorithm reduces the number of multiplications and additions required for multiplication of binary polynomials by using a divide-and-conquer approach. The algorithm also minimizes the number of temporary storage registers required during the multiplication process, thereby reducing the overall complexity of the algorithm. Experimental results show that the proposed algorithm outperforms existing algorithms in terms of speed and hardware complexity for polynomial multiplication in finite fields. The proposed algorithm is suitable for hardware implementation in applications such as error-correcting codes, cryptographic systems and digital signal processing.

References

  1. R. Abu-Salma, M. A. Sasse, J. Bonneau, A. Danilova, A. Naiakshina, and M. Smith, “Obstacles to the adoption of secure communication tools,” in Proc. IEEE Symp. Secur. Privacy (SP), May 2017, pp. 137–153.
  2. B. Vembu, A. Navale, and S. Sadhasivan, “Creating secure communication channels between processing elements,” U.S. Patent 9 589 159, Mar. 7, 2017.
  3. J. Yoo and J. H. Yi, “Code-based authentication scheme for light weight integrity checking of smart vehicles,” IEEE Access, vol. 6, pp. 46731–46741, 2018.
  4. P. Aparna and P. V. V. Kishore, “Biometric-based efficient medical image watermarking in E-healthcare application,” IET Image Process., vol. 13, no. 3, pp. 421–428, 2019.
  5. T. D. Premila Bai, K. M. Raj, and S. A. Rabara, “Elliptic curve cryptography based security framework for Internet of Things (IoT) enabled smart card,” in Proc. World Congr. Comput. Commun. Technol. (WCCCT), Feb. 2017, pp. 43–46.
  6. Z. U. A. Khan and M. Benaissa, “High-speed and low-latency ECC processor implementation over GF(2m) on FPGA,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 25, no. 1, pp. 165–176, Jan. 2017.
  7. G. Chen, G. Bai, and H. Chen, “A high-performance elliptic curve cryptographic processor for general curves over GF(p) based on a systolic arithmetic unit,” IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 54, no. 5, pp. 412–416, May 2007.
  8. H. Marzouqi, M. Al-Qutayri, K. Salah, D. Schinianakis, and T. Stouraitis, “A high-speed FPGA implementation of an RSD-based ECC processor,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 24, no. 1, pp. 151–164, Jan. 2016.
  9. K. C. C. Loi and S. B. Ko, “Scalable elliptic curve cryptosystem FPGA processor for NIST prime curves,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 23, no. 11, pp. 2753–2756, Jan. 2015.
  10. N. Y. Goshwe, “Data encryption and decryption using RSA algorithm in a network environment,” Int. J. Comput. Sci. Netw. Secur. (IJCSNS), vol. 13, no. 7, p. 9, 2013.
  11. R. J. McEliece, Finite Fields for Computer Scientists and Engineers, vol. 23. Boston, MA, USA: Springer, 2012.
  12. N. Homma, K. Saito, and T. Aoki, “Toward formal design of practical cryptographic hardware based on Galois field arithmetic,” IEEE Trans. Comput., vol. 63, no. 10, pp. 2604–2613, Oct. 2014.
  13. A. D. Piccoli, A. Visconti, and O. G. Rizzo, “Polynomial multiplication over binary finite fields: New upper bounds,” J. Cryptograph. Eng., vol. 10, pp. 197–210, Apr. 2019.
  14. F. Mallouli, A. Hellal, N. Sharief Saeed, and F. Abdulraheem Alzahrani, “A survey on cryptography: Comparative study between RSA vs ECC algorithms, and RSA vs el-gamal algorithms,” in Proc. 6th IEEE Int. Conf. Cyber Secur. Cloud Comput. (CSCloud)/5th IEEE Int. Conf. Edge Comput. Scalable Cloud (EdgeCom), Jun. 2019, pp. 173–176.
  15. B. Sunar, “A generalized method for constructing subquadratic complexity GF (2k) multipliers,” IEEE Trans. Comput., vol. 53, no. 9, pp. 1097–1105, Sep. 2004.

International Journal of Scientific Research in Science and Technology

Downloads

Published

2023-09-11

Issue

Volume 10, Issue 5, September-October-2023

Section

Research Articles

License

Copyright (c) IJSRST

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Konduri Prasanna Lakshmi, Dr. S. Leela Lakshmi "A Novel Binary Polynomial Multiplier Based on M-Term Karatsuba for Finite Field Computation" International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011,Volume 10, Issue 5, pp.91-98, September-October-2023.