New Representation Method For Integers And Its Application On Elliptic Curve Cryptography

Simple item page
dc.contributor.authorEghdamian, Arash
dc.date.accessioned2022-11-08T02:15:45Z
dc.date.available2022-11-08T02:15:45Z
dc.date.issued2020-01
dc.description.abstractPublic-key cryptosystems are broadly used in security protocols such as key agreement, authentication, encryption and others. The two main operations in many public-key algorithms are multiplication and exponentiation of large numbers. The performance and efficiency of these cryptographic primitives are highly reliant on the efficiency of these operations. Improving the efficiency of multiplication and exponentiation by applying a recoding method or using a specific number system which can reduction the Hamming Weight of numbers is very common. This study proposes a new Radix-r representation for integers which is known as Modified Generalized Non-Adjacent Form (MGNAF).en_US
dc.identifier.urihttp://hdl.handle.net/123456789/16560
dc.language.isoenen_US
dc.publisherUniversiti Sains Malaysiaen_US
dc.subjectNew Representation Method For Integersen_US
dc.subjectApplication On Elliptic Curve Cryptographyen_US
dc.titleNew Representation Method For Integers And Its Application On Elliptic Curve Cryptographyen_US
dc.typeThesisen_US
Files
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Pusat Pengajian Sains Komputer - Tesis