AN INVENTIVE DIGIT-FLAT SEQUENTIAL COMPARABLE CONFIGURATION FOR MULTIPLY

Gunda Geetha Priyanka, P. Suresh Kumar

Abstract


Through efficient projection of signal-flow graph (SFG) from the suggested formula, a very regular processor-space flow-graph (PSFG) comes. Redundant basis (RB) multipliers over Galois Field( ) have acquired huge recognition in elliptic curve cryptography (ECC) mainly due to their minimal hardware cost for squaring and modular reduction. Within this paper, we've suggested a manuscript recursive decomposition formula for RB multiplication to acquire high-throughput digit-serial implementation. It's proven the suggested high-throughput structures are the most useful one of the corresponding designs, for FPGA and ASIC implementation. By determining appropriate cut-sets, we've modified the PSFG superbly and carried out efficient feed-forward cut-set retiming to derive three novel multipliers which not just involve considerably a shorter period-complexity compared to existing ones but additionally require less area and fewer power consumption in comparison using the others. The synthesis recent results for field programmable gate array (FPGA) and application specific integrated circuit (ASIC) realization from the suggested designs and competing existing designs are in comparison. It's proven the suggested designs are capable of as much as 94% and 60% savings of area-delay-power product (ADPP) on FPGA and ASIC implementation over the very best of the present designs, correspondingly. Both theoretical analysis and synthesis results read the efficiency of suggested multipliers within the existing ones.

 


Keywords


ASIC; Digit-Serial; Finite Field Multiplication; FPGA;

References


N. R. Murthy and M. N. S. Swamy, “Cryptographic applications of brahmaqupta-bha skara equation,” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 53, no. 7, pp. 1565–1571, 2006.

A. Reyhani-Masoleh and M. A. Hasan, “Low complexity word-level sequential normal basis multipliers,” IEEE Trans. Comput., vol. 54, no. 2, pp. 98–C110, Feb. 2005.

A. H. Namin, H. Wu, and M. Ahmadi, “An efficient finite field multiplier using redundant representation,” ACMTrans. Embedded Comput. Sys., vol. 11, no. 2, Jul. 2012, Art. 31.

H.Wu, M. A. Hasan, I. F. Blake, and S. Gao, “Finite field multiplier using redundant representation,” IEEE Trans. Comput., vol. 51, no. 11, pp. 1306–1316, Nov. 2002.

A. H. Namin, H. Wu, and M. Ahmadi, “An efficient finite field multiplier using redundant representation,” ACMTrans. Embedded Comput. Sys., vol. 11, no. 2, Jul. 2012, Art. 31.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2020, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.