Enhancing quantum key distribution technique

Dissertant

Abu Ayyash, Abd Allah Muhammad

Thesis advisor

al-Ajluni, Naim M. M.

Comitee Members

al-Shalabi, Riyad
Abu al-Suud, Salih Mustafa
al-Shaykh, Asim A. R.

University

Arab Academy for Financial and Banking Sciences

Faculty

The Faculty of Information Systems and Technology

Department

Computer information systems

University Country

Jordan

Degree

Ph.D.

Degree Date

2008

English Abstract

The issue of secure communication has been for long time a problem that needs to be solved.

A proposed solution is to use mathematical science for encryption and decryption of messages, by utilizing some of the mathematical problems such as "Factorization Problem" and "Discrete Log".

When the science of quantum physics emerged, new problems came along.

The most important of these problems is "Uncertainty" in which one cannot (read) measure two non-orthogonal properties for a quantum particle with high precision.

Although at the quantum level, theoretical designed techniques and protocols have different effects than reality (implementation).

This is due to the difficulty of building ideal quantum channels, detectors, generators, operators and a quantum memory that is able to maintain the processed quantum particles in the same state without interacting with the environment.

In addition to other problems related to checking the presence of eavesdroppers on the communication line, the minimization of their understanding of the message contents is a vital problem.

All such problems result in a big gap between ideal protocols and implemented techniques.

This research is concerned with quantum key distribution (QKD) technique; the work will be mainly concentrated on the development of algorithmic solutions to increase the key length (gain) for existing protocols, this is achieved by recovering some of the quantum lost bits.

From our test, the first proposed technique achieved an increase of about 5.5 %, while about 30 % in the second technique for all transmitted information.

The results proved that the second technique achieved better gains than the first; however, the security analysis showed that the second technique is less secure than the first technique.

Both algorithms will not allow an eavesdropper to gain enough information to recover the original key.

Main Subjects

Information Technology and Computer Science

Topics

• Encryption
• Computer software
• Computer networks
• Security measures
• Data

No. of Pages

109

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-306142