New montgomery modular multıplier architecture

Download
index.pdf
2005
Çiftçibaşı, Mehmet Emre
Show full item record
186
views
68
downloads
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 Xilinx FPGA on the custom printed circuit board. The windows user interface is developed in Borland Builder environment and the ethernet interface is implemented by Ubicom IP2022 controller. The algorithms are compared from operating clock frequency, silicon area cost and multiplication time perspectives. The new architecture multiplies two times faster in GF(p) and four times faster in GF(2n), compared to the previous architectures as expected. The operand length is increased from 8 bits to 1024 bits, with the compromise of decreasing the operating clock frequency from 150 Mhz down to 15 Mhz.
Electronic computers.
http://etd.lib.metu.edu.tr/upload/12606965/index.pdf
https://hdl.handle.net/11511/15691
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

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...
On an architecture for a parallel finite field multiplier with low complexity based on composite fields
Kındap, Nihal; Özbudak, Ferruh; Department of Cryptography (2004)
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 ...
Genetic algorithm for personnel assignment problem with multiple objectives
Arslanoğlu, Yılmaz; Toroslu, İsmail Hakkı; Department of Computer Engineering (2006)
This thesis introduces a multi-objective variation of the personnel assignment problem, by including additional hierarchical and team constraints, which put restrictions on possible matchings of the bipartite graph. Besides maximization of summation of weights that are assigned to the edges of the graph, these additional constraints are also treated as objectives which are subject to minimization. In this work, different genetic algorithm approaches to multi-objective optimization are considered to solve th...
Implementation of an 8-bit microcontroller with system c
Kesen, Lokman; Aşkar, Murat; Department of Electrical and Electronics Engineering (2004)
In this thesis, an 8-bit microcontroller, 8051 core, is implemented using SystemC programming language. SystemC is a new generation co-design language which is capable of both programming software and describing hardware parts of a complete system. The benefit of this design environment appears while developing a System-on-Chip (SoC), that is a system consisting both custom hardware parts and embedded software parts. SystemC is not a completely new language, but based on C++ with some additional class libra...
Generating motion-economical plans for manual operations
Canan, Özgen; Birtürk, Ayşe Nur; Department of Computer Engineering (2005)
This thesis discusses applying AI planning tools for generating plans for manual operations. Expertise of motion economy domain is used to select good plans among feasible ones. Motion economy is a field of industrial engineering, which deals with observing, reporting and improving manual operations. Motion economy knowledge is organized in principles regarding the sequences and characteristics of motions, arrangement of workspace, design of tools etc. A representation scheme is developed for products, work...
Citation Formats
M. E. Çiftçibaşı, “New montgomery modular multıplier architecture,” M.S. - Master of Science, Middle East Technical University, 2005.
METU IIS - Integrated Information Service open@metu.edu.tr