Efficient elliptic curve cryptosystems using efficient exponentiation

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

Darwish, Kamal

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

Salih, Muhammad

الجامعة

جامعة بيرزيت

الكلية

كلية الهندسة و التكنولوجيا

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

دائرة علم الحاسوب

دولة الجامعة

فلسطين (الضفة الغربية)

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

ماجستير

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

2006

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

The explosive growth in the use of mobile and wireless devices demands a public key cryptosystem (PCK) achieving aspects of information security with accommodate limitations on power and bandwidth, at the same time keeping with high level of security.

Elliptic curve cryptosystem (ECC) are new generation of public key cryptosystems that has smaller key sizes for the same level of security.

The exponentiation in elliptic curve is the most important operation in ECC, So when put the ECC into practice, the major problem is how to enhance the speed of the exponentiation.

It is thus of great interest to develop algorithms for exponentiation, which allow efficient implementations of ECC.

In this thesis, we improve efficient algorithm for exponentiation on elliptic curve defined over Fp in terms of affine coordinates.

The algorithm computes 2 n2 (2n P+Q) directly from random points P and Q on an elliptic curve, without computing the intermediate points.

Moreover, we apply this algorithm on exponentiation on elliptic curve with w MOF and analyze their computational complexity.

This algorithm can speed the w MOF exponentiation of elliptic curve of size 160-bit about (21.7 %) as a result of its implementation with respect to affine coordinates.

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

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

الموضوعات

• معالجة البيانات
• التشفير

عدد الصفحات

104

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

• APA
• MLA
• AMA

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-303313