Bileşik alanlara dayalı düşük komleksitili bir paralel sonlu alan çarpanı için bir yapı.

In this thesis, a bit parallel architecture for a parallel finite field multiplier with low complexity in composite fields GF((2n)m) with k = n · m (k 32) is investigated. The architecture has lower complexity when the Karatsuba-Ofman algorithm is applied for certain k. Using particular primitive polynomials for composite fields improves the complexities. We demonstrated for the values m = 2, 4, 8 in details. This thesis is based on the paper أA New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields ؤ by Christof Paar. The whole purpose of this thesis is to understand and present a detailed description of the results of the paper of Paar.M.S. - Master of Scienc