Design And Implementation Of Low-Complexity Redundant Multiplier Architecture For Finite Field

References

[1] Swamy.M.N, May (2007) “Cryptographic applications of bhaskara equations” IEEE Trans.Circ.Sys.I, vol.54, no.7, pp. 927-928.

[2] M.Nikooghadam, March (2013) “ Low Power and High-Speed Design of a Versatile Bit- Serial Multiplier in Finite Field, the VLSI journal, vol 46, Issue 2, pp.211-217.

[3] L.S.Hsu, H.M.Shao, (1987) “Comparison of VLSI Architecture of Finite Field Multipliers Using Dual, Normal or Standard basis,” IEEE Tran. Comp, pp.63-75.

[4] Zhi-Hong Mao, J.Xie, Jan (2015) “High- throughput finite field multipliers using redundant basis for FPGA and ASIC implementation,” IEEE Trans. Cirt. Sys-I, vol.62, no.1, pp.110-119.

[5] M.Uma.Maheswari, S.Bhaskar, November (2014) “High Speed Finite Field Multiplier GF(2m) for Cryptographic Applications,” IJARECE, vol.3, Issue 11, pp.1705-1708.

[6] B.Sargunam, Dr.R.Dhanasekaran, April (2014) “Word Level Finite Field Multipliers Using Normal Basis,” JTAIT, vol.62, no.3, pp.805-811.

[7] J-S.Pan, Mehar. P.K, December (2013) “Low latency digit serial digit parallel systolic multipliers for large binary extension fields,” IEEE Trans. Circt.and Syst-I, pp.1-11.

[8] I.-C.Jou , C.-Y Lee, Sep. (2005) “Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2m) ,” IEEE Trans. Compt., vol.54,no.9, pp.1061-1070.

@article{1700131,
      author = {VEERRAJU KAKI},
      title = {Design And Implementation Of Low-Complexity Redundant Multiplier Architecture For Finite Field},
      journal = {Iconic Research And Engineering Journals},
      year = {2017},
      volume = {1},
      number = {6},
      pages = {76-80},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1700131.pdf},
      abstract = {In the present work, a low-complexity Digit-Serial/parallel Multiplier over Finite Field is proposed. It is employed in applications like cryptography for data encryption and decryption to deal with discrete mathematical and arithmetic structures. The proposed multiplier utilizes a redundant representation because of their free squaring and modular reduction. The proposed 10-bit multiplier is simulated and synthesized using Xilinx Verilog HDL. It is evident from the simulation results that the multiplier has significantly low area and power when compared to the previous structures using the same representation.},
      keywords = {Digit-Serial, Finite Field multiplication, Redundant Basis},
      month = {December},
  }