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 &ldquo / A New Architecture for a Parallel Finite
Field Multiplier with Low Complexity Based on Composite Fields &rdquo / 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.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12605347/index.pdf |
| Date | 01 September 2004 |
| Creators | Kindap, Nihal |
| Contributors | Ozbudak, Ferruh |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0146 seconds