Advertisement

Design of Flexible Multiplier Using Wallace Tree Structure for ECC Processor Over Galosis Field

  • C. LakshmiEmail author
  • P. Jesu Jayarin
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 35)

Abstract

Security is a main parameter in Networks. To ensure the security in network various cryptography algorithms are implemented. Instead of using software based security, the hardware based security system increases security features. ECC processor is a hardware based security crypto processor works based on Elliptic curve cryptography, the key generation is very fast compare to AES, RSA. ECC processor has many modules such as arithmetic and logic units, Control unit etc.,. The Arithmetic unit Consist of Multiplier, Adder. Various optimization techniques and multiplier algorithm are implemented to increase the efficiency. In this paper we are proposed the novel architecture of flexible multiplier.

Keywords

ECC processor Elliptic curve cryptography Key generation Cryptography algorithms Flexible multiplier 

References

  1. 1.
    Marzouqi, H., Al-Qutayri, M., Salah, K.: RSD based Karatsuba multiplier for ECC processors. In: 2013 8th IEEE Design and Test Symposium, Marrakesh, pp. 1–2 (2013)Google Scholar
  2. 2.
    John, K.M., Sabi, S.: A novel high performance ECC processor architecture with two staged multiplier. In: 2017 IEEE International Conference on Electrical, Instrumentation and Communication Engineering (ICEICE), pp. 1–5, Karur (2017)Google Scholar
  3. 3.
    Sun, W., Dai, Z., Ren, N.: A unified, scalable dual-field montgomery multiplier architecture for ECCs. In: 2008 9th International Conference on Solid-State and Integrated-Circuit Technology, pp. 1881–1884, Beijing (2008)Google Scholar
  4. 4.
    Javeed, K., Wang, X., Scott, M.: Serial and parallel interleaved modular multipliers on FPGA platform. In: 2015 25th International Conference on Field Programmable Logic and Applications (FPL), pp. 1–4, London (2015)Google Scholar
  5. 5.
    Narh Amanor, D., Paar, C., Pelzl, J., Bunimov, V., Schimmler, M.: Efficient hardware architectures for modular multiplication on FPGAs. In: 2005 International Conference on Field Programmable Logic and Applications, August 2005, pp. 539–542 (2005)Google Scholar
  6. 6.
    Ananyi, K., Alrimeih, H., Rakhmatov, D.: Flexible hardware processor for elliptic curve cryptography over NIST prime fields. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 17(8), 1099–1112 (2009)CrossRefGoogle Scholar
  7. 7.
    Khan, Z.U.A.: High-speed and low-latency ECC processor implementation over GF (2m) on FPGA. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 25(1), 165–176 (2017)Google Scholar
  8. 8.
    Liu, Z., Seo, H., Castiglione, A., Choo, K.K., Kim, H.: Memory-efficient implementation of elliptic curve cryptography for the Internet-of-Things. IEEE Trans. Dependable Secure Comput. 16(3), 521–529 (2018)CrossRefGoogle Scholar
  9. 9.
    Imran, M., Rashid, M., Jafri, A.R., Najam-ul-Islam, M.: A Cryp-Proc: flexible asymmetric crypto processor for point multiplication. IEEE Access 6, 22778–22793 (2018).  https://doi.org/10.1109/access.2018.2828319CrossRefGoogle Scholar
  10. 10.
    Khan, Z., Benaissa, M.: Throughput/area-efficient ECC processor using montgomery point multiplication on FPGA. IEEE Trans. Circ. Syst. II: Express Briefs 62(11), 1078–1082 (2015)Google Scholar
  11. 11.
    Salman, A., Ferozpuri, A., Homsirikamol, E., Yalla, P., Kaps, J., Gaj, K.: A scalable ECC processor implementation for high-speed and lightweight with side-channel countermeasures. In: 2017 International Conference on ReConFigurable Computing and FPGAs (ReConFig), pp. 1–8, Cancun (2017)Google Scholar
  12. 12.
    Huang, M., Gaj, K., El-Ghazawi, T.: New hardware architectures for montgomery modular multiplication algorithm. IEEE Trans. Comput. 60(7), 923–936 (2011)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Hasan, M.A., Namin, A.H., Negre, C.: Toeplitz matrix approach for binary field multiplication using quadrinomials. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 20(3), 449–458 (2012)CrossRefGoogle Scholar
  14. 14.
    Loi, K.C.C., Ko, S.B.: Scalable elliptic curve cryptosystem FPGA processor for NIST prime curves. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 23(11), 2753–2756 (2015)CrossRefGoogle Scholar
  15. 15.
    Fournaris, A.P., Zafeirakis, J., Koufopavlou, O.: Designing and evaluating high speed elliptic curve point multipliers. In: Proceedings of the 17th Euromicro Conference Digital System Design (DSD), August 2014, pp. 169–174 (2014)Google Scholar
  16. 16.
    Fan, H., Hasan, M.A.: A survey of some recent bit-parallel GF (2n) multipliers. Finite Fields Appl. 32, 5–43 (2015)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Petra, N., Caro, D.D., Strollo, A.G.M.: A novel architecture for galois fields GF (2 m) multipliers based on Mastrovito scheme. IEEE Trans. Comput., 56(11), 1470–1483 (2007)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Sathyabama Institute of Science and TechnologyChennaiIndia
  2. 2.Jeppiaar Engineering CollegeChennaiIndia

Personalised recommendations