dc.contributor.authorSatzoda Ravi Kumaren_US
dc.date.accessioned2010-05-21T04:38:34Z
dc.date.accessioned2017-07-23T08:32:48Z
dc.date.available2010-05-21T04:38:34Z
dc.date.available2017-07-23T08:32:48Z
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.schoolSchool of Electrical and Electronic Engineeringen_US
dc.contributor.supervisorChang Chip Hongen_US
dc.description.degreeMASTER OF ENGINEERING (EEE)en_US
dc.identifier.doihttps://doi.org/10.32657/10356/39047


Files in this item

FilesSizeFormatView
SatzodaRaviKumar2007.pdf17.09Mbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record