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

Public-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...

Szczegółowa specyfikacja

Opis bibliograficzny
1. autor: Eghdamian, Arash
Format: Praca dyplomowa
Język:English
Wydane: 2020
Hasła przedmiotowe:
Dostęp online:http://eprints.usm.my/55545/1/Pages%20from%20Arash%20Eghdamian%20Final%20Version%2027-01-2020%20cut.pdf
_version_ 1825907315360923648
author Eghdamian, Arash
author_facet Eghdamian, Arash
author_sort Eghdamian, Arash
collection USM
description Public-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).
first_indexed 2024-03-06T16:02:23Z
format Thesis
id usm.eprints-55545
institution Universiti Sains Malaysia
language English
last_indexed 2024-03-06T16:02:23Z
publishDate 2020
record_format dspace
spelling usm.eprints-555452022-11-08T02:25:12Z http://eprints.usm.my/55545/ New Representation Method For Integers And Its Application On Elliptic Curve Cryptography Eghdamian, Arash QA75.5-76.95 Electronic computers. Computer science Public-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). 2020-01 Thesis NonPeerReviewed application/pdf en http://eprints.usm.my/55545/1/Pages%20from%20Arash%20Eghdamian%20Final%20Version%2027-01-2020%20cut.pdf Eghdamian, Arash (2020) New Representation Method For Integers And Its Application On Elliptic Curve Cryptography. PhD thesis, Universiti Sains Malaysia.
spellingShingle QA75.5-76.95 Electronic computers. Computer science
Eghdamian, Arash
New Representation Method For Integers And Its Application On Elliptic Curve Cryptography
title New Representation Method For Integers And Its Application On Elliptic Curve Cryptography
title_full New Representation Method For Integers And Its Application On Elliptic Curve Cryptography
title_fullStr New Representation Method For Integers And Its Application On Elliptic Curve Cryptography
title_full_unstemmed New Representation Method For Integers And Its Application On Elliptic Curve Cryptography
title_short New Representation Method For Integers And Its Application On Elliptic Curve Cryptography
title_sort new representation method for integers and its application on elliptic curve cryptography
topic QA75.5-76.95 Electronic computers. Computer science
url http://eprints.usm.my/55545/1/Pages%20from%20Arash%20Eghdamian%20Final%20Version%2027-01-2020%20cut.pdf
work_keys_str_mv AT eghdamianarash newrepresentationmethodforintegersanditsapplicationonellipticcurvecryptography