Enhanced method for RSA cryptosystem algorithm

Other Title(s)

طريقة مطورة في خوارزمية تشفير المفتاح العام RSA

Dissertant

al-Darayisah, Ibrahim Abd Allah

Thesis advisor

al-Hamami, Ala Husayn

Comitee Members

Atir, Muhammad Abd Allah
Azami, Muayyad Abd al-Razzaq

University

Amman Arab University

Faculty

Collage of Computer Sciences and Informatics

Department

Department of Computer Science

University Country

Jordan

Degree

Master

Degree Date

2011

English Abstract

The motive of this thesis is the desire to improve the protection of information and data on the use of encryption algorithms.

Improving the specific encryption algorithm, due to the increment transmission of data and information, will protect the privacy and satisfy authentication.

In this thesis, it was proposed to enhance the RSA ( which stands for Rivest, Shamir and Adleman who first publicly described it ) algorithm through the use of additional third prime number in the composition of the public key and private key.

This will increase the analysis complexity of the variable (N), where the process of its analysis with the development of equipments and tools become much easier nowadays.

The existence of three prime numbers will give the ability to the developed encryption method to increase the difficulty of analysis of the variable (n), In addition to increasing the speed of the process encryption and decryption.

It is possible to generate a public key and private key without the need to use major calculations.

To generate a variable (n) using the original RSA algorithm, which contributes to generate the public key and private key, large and have a number of 300 digits.

To use two primes numbers each of them is a number composed of 150 digits.

In this case if the multiplication process has been used, it will take longer than the time of generating the same variable (n) by using the no more proposed method which uses three prime numbers where each number length 100 digits.

We have conducted experiments on a set of numbers randomly, as it proved that the Enhanced Method for RSA Cryptosystem Algorithm gone a significant results in terms of speed other than the original algorithms.

In terms of encryption and decryption hand to generate the public key and private key, as well as showing that the analysis of the variable (n) takes a long time in the proposed method for algorithm RSA about the original method and this indicates the increasing difficulty in the way of analysis developed.

Main Subjects

Mathematics

Topics

• Algorithms
• Writing
• Encryption
• Symbolism
• Data

No. of Pages

114

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-525961