Efficient elliptic curve cryptosystems using efficient exponentiation

Dissertant

Darwish, Kamal

Thesis advisor

Salih, Muhammad

University

Birzeit University

Faculty

Faculty of Engineering and Technology

Department

Department of Computer Science

University Country

Palestine (West Bank)

Degree

Master

Degree Date

2006

English Abstract

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.

Main Subjects

Information Technology and Computer Science

Topics

• Data processing
• Encryption

No. of Pages

104

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-303313