Title: Low Complexity GF(2<sup>m</sup>) Multiplier Based on Iterative Karatsuba Algorithm
Abstract: The complexity is one important index for Galois Field multiplier. This paper presents one low complexity GF(2 m ) multiplier based on iterative Karatsuba algorithm. The multiplication is replaced iteratively by three ones of half-length operands which are performed in parallel. The operands are divided into different width such as 64-bit, 32-bit, 16-bit and so on. For the 2 m *2 m multiplier, we take 128 bit-widthGF(2 128 ) multipliers as an example. We implement them on FPGA and count the number of the used LUTs and the used registers. Through analyzing the statistic, we find that, when the width of the two multiplication operands is divided to 8 bit, the multiplier consumes the least resources. Compared with the FPGA implementation of the other previous multiplier, this optimum multiplier can save 50% resources in LUTs and the registers.
Publication Year: 2012
Publication Date: 2012-07-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot