On an architecture for a parallel finite field multiplier with low complexity based on composite fields

Download

index.pdf

Date

2004

Author

Kındap, Nihal

Metadata

Show full item record

Item Usage Stats

192
views

77
downloads

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.

Subject Keywords

Electronic computers.

URI

http://etd.lib.metu.edu.tr/upload/12605347/index.pdf
https://hdl.handle.net/11511/14582

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

New montgomery modular multıplier architecture Çiftçibaşı, Mehmet Emre; Yücel, Melek D; Department of Electrical and Electronics Engineering (2005) This thesis is the real time implementation of the new, unified field, dualا radix Montgomery modular multiplier architecture presented by Savaş et al, for performance comparison with standard Montgomery multiplication algorithms. The unified field architecture operates in both GF(p) and GF(2n). The dual radix capability enables processing of two bits of the multiplier in every clock cycle in GF(2n) mode, while one bit of the multiplier is processed in GF(p) mode. The new architecture is implemented in a Xi...
Comparison of rough multi layer perceptron and rough radial basis function networks using fuzzy attributes Vural, Hülya; Alpaslan, Ferda Nur; Department of Computer Engineering (2004) The hybridization of soft computing methods of Radial Basis Function (RBF) neural networks, Multi Layer Perceptron (MLP) neural networks with back-propagation learning, fuzzy sets and rough sets are studied in the scope of this thesis. Conventional MLP, conventional RBF, fuzzy MLP, fuzzy RBF, rough fuzzy MLP, and rough fuzzy RBF networks are compared. In the fuzzy neural networks implemented in this thesis, the input data and the desired outputs are given fuzzy membership values as the fuzzy properties أlow...
Progresses in parallel random number generators Kaşıkara Tenekecioğlu, Gülin; Kiper, Ayşe; Department of Computer Engineering (2005) Monte Carlo simulations are embarrassingly parallel in nature, so having a parallel and efficient random number generator becomes crucial. To have a parallel generator with uncorrelated processors, parallelization methods are implemented together with a binary tree mapping. Although, this method has considerable advantages, because of the constraints arising from the binary tree structure, a situation defined as problem of falling off the tree occurs. In this thesis, a new spawning method that is based on b...
Monte Carlo analysis of ridged waveguides with transformation media Ozgun, Ozlem; Kuzuoğlu, Mustafa (Wiley, 2013-07-01) A computational model is presented for Monte Carlo simulation of waveguides with ridges, by combining the principles of transformation electromagnetics and the finite methods (such as finite element or finite difference methods). The principle idea is to place a transformation medium around the ridge structure, so that a single and easy-to-generate mesh can be used for each realization of the Monte Carlo simulation. Hence, this approach leads to less computational resources. The technique is validated by me...
Transformation-based metamaterials to eliminate the staircasing error in the finite difference time domain method Ozgun, Ozlem; Kuzuoğlu, Mustafa (Wiley, 2012-07-01) A coordinate transformation technique is introduced for the finite difference time domain method to alleviate the effects of errors introduced by the staircasing approximation of curved geometries that do not conform to a Cartesian grid. An anisotropic metamaterial region, which is adapted to the Cartesian grid and designed by the coordinate transformation technique, is constructed around the curved boundary of the object, and the region occupied between the curved boundary and the inner boundary of the ani...

Citation Formats

N. Kındap, “On an architecture for a parallel finite field multiplier with low complexity based on composite fields,” M.S. - Master of Science, Middle East Technical University, 2004.