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

Full description

Saved in:

Bibliographic Details
Main Author:	Eghdamian, Arash
Format:	Thesis
Language:	English
Published:	2020
Subjects:	QA75.5-76.95 Electronic computers Computer science
Online Access:	http://eprints.usm.my/55545/1/Pages%20from%20Arash%20Eghdamian%20Final%20Version%2027-01-2020%20cut.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-usm-ep.55545
record_format	uketd_dc
spelling	my-usm-ep.555452022-11-08T02:25:12Z New Representation Method For Integers And Its Application On Elliptic Curve Cryptography 2020-01 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 http://eprints.usm.my/55545/ http://eprints.usm.my/55545/1/Pages%20from%20Arash%20Eghdamian%20Final%20Version%2027-01-2020%20cut.pdf application/pdf en public phd doctoral Universiti Sains Malaysia Pusat Pengajian Sains Komputer (School of Computer Sciences)
institution	Universiti Sains Malaysia
collection	USM Institutional Repository
language	English
topic	QA75.5-76.95 Electronic computers Computer science
spellingShingle	QA75.5-76.95 Electronic computers Computer science Eghdamian, Arash New Representation Method For Integers And Its Application On Elliptic Curve Cryptography
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).
format	Thesis
qualification_name	Doctor of Philosophy (PhD.)
qualification_level	Doctorate
author	Eghdamian, Arash
author_facet	Eghdamian, Arash
author_sort	Eghdamian, Arash
title	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_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_sort	new representation method for integers and its application on elliptic curve cryptography
granting_institution	Universiti Sains Malaysia
granting_department	Pusat Pengajian Sains Komputer (School of Computer Sciences)
publishDate	2020
url	http://eprints.usm.my/55545/1/Pages%20from%20Arash%20Eghdamian%20Final%20Version%2027-01-2020%20cut.pdf
_version_	1776101092363337728

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

Similar Items