Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/39047
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSatzoda Ravi Kumar.en_US
dc.date.accessioned2010-05-21T04:38:34Z-
dc.date.available2010-05-21T04:38:34Z-
dc.date.copyright2007en_US
dc.date.issued2007-
dc.identifier.citationSatzoda, R. K. (2007). Fast finite field multipliers for public key cryptosystems. Master’s thesis, Nanyang Technological University, Singapore.
dc.identifier.urihttp://hdl.handle.net/10356/39047-
dc.description144 p.en_US
dc.description.abstractThe 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).en_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineeringen_US
dc.titleFast finite field multipliers for public key cryptosystemsen_US
dc.typeThesisen_US
dc.contributor.supervisorChang Chip Hongen_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.description.degreeMaster of Engineeringen_US
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:EEE Theses
Files in This Item:
File Description SizeFormat 
SatzodaRaviKumar2007.pdfMain report16.69 MBAdobe PDFThumbnail
View/Open

Google ScholarTM

Check

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