Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/39047
Title: Fast finite field multipliers for public key cryptosystems
Authors: Satzoda Ravi Kumar
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2007
Source: Satzoda, R. K. (2007). Fast finite field multipliers for public key cryptosystems. Master’s thesis, Nanyang Technological University, Singapore.
Abstract: The security strength of Public Key Cryptosystems (PKCs) is attributed to the complex computations that are employed in the encryption and decryption algorithms. These algorithms are executed by cryptoprocessors which are used as embedded co-processors in devices like smartcards, smart cameras etc. Speed of operation, circuit area and security strength variability are vital design considerations in such applications. These criteria call for efficient hardware implementation of the underlying arithmetic operations of the algorithms. Multiplication in finite fields, widely known as finite field multiplication or modular multiplication, forms the core computational engine of all algorithms involved in PKCs. The research work in this thesis aims at developing efficient architectures for finite field multiplications in the prime field GF(N) and the extended binary field GF(2m).
Description: 144 p.
URI: https://hdl.handle.net/10356/39047
DOI: 10.32657/10356/39047
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
SatzodaRaviKumar2007.pdf
Main report16.69 MBAdobe PDFThumbnail
View/Open

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.