Low Complexity Finite Field Multiplier for a New Class of Fields

مرکز و کتابخانه مطالعات اسلامی به زبان های اروپایی

منو

" Low Complexity Finite Field Multiplier for a New Class of Fields "
Seyed Mohammad Ali Shahabi

Document Type	:	Latin Dissertation
Language of Document	:	English
Record Number	:	54582
Doc. No	:	TL24536
Call number	:	‭MR73693‬
Main Entry	:	Seyed Mohammad Ali Shahabi
Title & Author	:	Low Complexity Finite Field Multiplier for a New Class of Fields\ Seyed Mohammad Ali Shahabi
College	:	University of Windsor (Canada)
Date	:	2009
Degree	:	M.A.Sc.
student score	:	2009
Page No	:	82
Abstract	:	Finite fields is considered as backbone of many branches in number theory, coding theory, cryptography, combinatorial designs, sequences, error-control codes, and algebraic geometry. Recently, there has been considerable attention over finite field arithmetic operations, specifically on more efficient algorithms in multiplications. Multiplication is extensively utilized in almost all branches of finite fields mentioned above. Utilizing finite field provides an advantage in designing hardware implementation since the ground field operations could be readily converted to VLSI design architecture. Moreover, due to importance and extensive usage of finite field arithmetic in cryptography, there is an obvious need for better and more efficient approach in implementation of software and/or hardware using different architectures in finite fields. This project is intended to utilize a newly found class of finite fields in conjunction with the Mastrovito algorithm to compute the polynomial multiplication more efficiently.
Subject	:	Applied sciences; Electrical engineering; 0544:Electrical engineering
Added Entry	:	University of Windsor (Canada)