Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In this study high-performance and high-speed field-programmable gate array (FPGA) implementations of polynomial basis Itoh–Tsujii inversion algorithm (ITA) over GF(2 m ) constructed by irreducible trinomials and pentanomials are presented. The proposed structures are designed by one field multiplier and k -times squarer blocks or exponentiation by 2 k , where k is a small positive integer. The k -times squarer blocks have an efficient tree structure with low critical path delay, and the multiplier is based on a proposed high-speed digit-serial architecture with minimum hardware resources. Furthermore, to reduce the computation time of ITA, the critical path of the circuit is broken to finer path using several registers. The computation times of the structure on Virtex-4 FPGA family are 0.262, 0.192 and 0.271 µs for GF(2163), GF(2193) and GF(2233), respectively. The comparison results with other implementations of the polynomial basis Itoh–Tsujii inversion algorithm verify the improvement in the proposed architecture in terms of speed and performance.
['Bahram Rashidi', 'Reza Rezaeian Farashahi', 'Sayed Masoud Sayedi']
I am writing a research paper on a idea High-performance and high-speed implementation of polynomial basis Itoh–Tsujii inversion algorithm over GF(2 m )
[{"from": "human", "value": "I am writing a research paper on a idea High-performance and high-speed implementation of polynomial basis Itoh\u2013Tsujii inversion algorithm over GF(2 m )"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In this study high-performance and high-speed field-programmable gate array (FPGA) implementations of polynomial basis Itoh\u2013Tsujii inversion algorithm (ITA) over GF(2 m ) constructed by irreducible trinomials and pentanomials are presented. The proposed structures are designed by one field multiplier and k -times squarer blocks or exponentiation by 2 k , where k is a small positive integer. The k -times squarer blocks have an efficient tree structure with low critical path delay, and the multiplier is based on a proposed high-speed digit-serial architecture with minimum hardware resources. Furthermore, to reduce the computation time of ITA, the critical path of the circuit is broken to finer path using several registers. The computation times of the structure on Virtex-4 FPGA family are 0.262, 0.192 and 0.271\u2005\u00b5s for GF(2163), GF(2193) and GF(2233), respectively. The comparison results with other implementations of the polynomial basis Itoh\u2013Tsujii inversion algorithm verify the improvement in the proposed architecture in terms of speed and performance."}]