Enhancing Speed Performance of the Cryptographic Algorithm Based on the Lucas Sequence

M. Abulkhirat, Esam (2003) Enhancing Speed Performance of the Cryptographic Algorithm Based on the Lucas Sequence. Masters thesis, Universiti Putra Malaysia.

[img] PDF
1057Kb

Abstract

Computer information and network security has recently become a popular subject due to the explosive growth of the Internet and the migration of commerce practices to the electronic medium. Thus the authenticity and privacy of the information transmitted and the data stored on networked computers is of utmost importance. The deployment of network security procedures requires the implementation of cryptographic functions. More specifically, these include encryption, decryption, authentication, digital signature algorithms and message-digest functions. Performance has always been the most critical characteristic of a cryptographic function, which determines its effectiveness.Since the discovery of public-key cryptography, very few convincingly secure asymmetric schemes have been discovered despite considerable research efforts. Utilizing the properties of Lucas functions introduced a public key system based on Lucas functions instead of exponentiation, which offer a good alternative to the most publicly used exponential public key system RSA. LUC cryptosystem algorithm based on the quadratic and cubic polynomial, is introduced in this thesis with a new formula to distinguishing between the cubic polynomial roots. Reducing the calculation time of the algorithm, in sequential and parallel platforms, using the doubling-rule technique combined with a new scheme led to a strong improvement of the LUC algorithm speed. The computation time analysis shows that whene doubling with remainder technique is used, the improvement of the speed rises rapidly compared to the standard implementation of the LUC algorithm and LUC algorithm with doubling rule. Furthermore the algorithm is still keeping its simplicity of non-multiplicative and nonexponentiation public-key cryptosystem. The improved algorithm is applied on the lab-PC for the sequential platform, and cluster-computing machine for the parallel platform, which lead to a substantial time reduction and an enhancement of the algorithm speed in both platforms.

Item Type:Thesis (Masters)
Subject:Cryptography
Subject:Lucas numbers
Subject:Computer networks - Security measures
Chairman Supervisor:Associate Professor Mohamed Othman, PhD
Call Number:FSKTM 2003 5
Faculty or Institute:Faculty of Computer Science and Information Technology
ID Code:8703
Deposited By: Nurul Hayatie Hashim
Deposited On:15 Dec 2010 04:58
Last Modified:10 Dec 2012 05:05

Repository Staff Only: item control page

Document Download Statistics

This item has been downloaded for since 15 Dec 2010 04:58.

View statistics for "Enhancing Speed Performance of the Cryptographic Algorithm Based on the Lucas Sequence"


Universiti Putra Malaysia Institutional Repository

Universiti Putra Malaysia Institutional Repository is an on-line digital archive that serves as a central collection and storage of scientific information and research at the Universiti Putra Malaysia.

Currently, the collections deposited in the IR consists of Master and PhD theses, Master and PhD Project Report, Journal Articles, Journal Bulletins, Conference Papers, UPM News, Newspaper Cuttings, Patents and Inaugural Lectures.

As the policy of the university does not permit users to view thesis in full text, access is only given to the first 24 pages only.