Computation complexity improvement for digital signature algorithm

العناوين الأخرى

تحسين تعقيد الحسابات لخوارزمية التوقيع الرقمي

مقدم أطروحة جامعية

Rifat, Muhammad Mustafa

مشرف أطروحة جامعية

al-Sawadi, Hamzah Abbas

أعضاء اللجنة

al-Jarrah, Muzaffar
al-Hajj Hasan, Muhammad Mustafa Sulayman

الجامعة

جامعة الشرق الأوسط

الكلية

كلية تكنولوجيا المعلومات

القسم الأكاديمي

قسم علم الحاسوب

دولة الجامعة

الأردن

الدرجة العلمية

ماجستير

تاريخ الدرجة العلمية

2017

الملخص الإنجليزي

Digital signature is an authentic method of the received data/messages in the digital world.

It is considered to be equivalent to hand written signature which provides the authenticity of the signed papers.

Digital signature algorithm (DSA) adopted for the first time at 1991 by National Institute of Standards and Technology (NIST) for use in their digital signature standard.

DSA uses Discrete Logarithm Problem (DLP) to generate signature for signed messages.

Many variants of DSA appeared and has been suggested in order to improve the performance, such as Yen-Laih, GOST, McCurley, and other algorithms.

In this thesis a modified version of DSA (referred to as M.DSA) is proposed with the aim of enhancing the time complexity measurement, i.e.

looking for faster implementation.

Mathematical proof of this modified version is also included.

The work starts with an investigation for the DSA and four of its variants in order to examine the effect of the digital signature parameters variations on their performance.

The average time for signing and verification for the original DSA, modified DSA, and all the other variants are computed for various parameter lengths of private keys randomly generated keys, and messages, then comparison between all results was conducted.

Experimental computations have shown clearly that M.DSA has better validation time as compared with others.

Also, the overall time complexity was impressive, and the speed gain about two times the original DSA overall time.

Hence it is recommended that this modified version of DSA would be used for applications that require fast verification time.

التخصصات الرئيسية

تكنولوجيا المعلومات وعلم الحاسوب

الموضوعات

عدد الصفحات

94

قائمة المحتويات

Table of contents.

Abstract.

Abstract in Arabic.

Chapter One : Introduction.

Chapter Two : Theoretical background and literature review.

Chapter Three : The proposed modified DSA.

Chapter Four : Implementation and results.

Chapter Five : Conclusion and future work.

References.

نمط استشهاد جمعية علماء النفس الأمريكية (APA)

Rifat, Muhammad Mustafa. (2017). Computation complexity improvement for digital signature algorithm. (Master's theses Theses and Dissertations Master). Middle East University, Jordan
https://search.emarefa.net/detail/BIM-762689

نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)

Rifat, Muhammad Mustafa. Computation complexity improvement for digital signature algorithm. (Master's theses Theses and Dissertations Master). Middle East University. (2017).
https://search.emarefa.net/detail/BIM-762689

نمط استشهاد الجمعية الطبية الأمريكية (AMA)

Rifat, Muhammad Mustafa. (2017). Computation complexity improvement for digital signature algorithm. (Master's theses Theses and Dissertations Master). Middle East University, Jordan
https://search.emarefa.net/detail/BIM-762689

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-762689