Parallel computation for LUC Cryptosystems on distributed memory multiprocessor machine

Authors:
Zulkarnain Md Ali;Mohamed Othman;Mohd Rushdan Muhd Said;Mohammad Nasir Sulaiman
Affiliations:
Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia;Universiti Putra Malaysia, Serdang, Selangor, Malaysia;Universiti Putra Malaysia, Serdang, Selangor, Malaysia;Universiti Putra Malaysia, Serdang, Selangor, Malaysia
Venue:
ACST '08 Proceedings of the Fourth IASTED International Conference on Advances in Computer Science and Technology
Year:
2008

Citing 2
Cited 0

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
LUC: A New Public Key System

IFIP/Sec '93 Proceedings of the IFIP TC11, Ninth International Conference on Information Security: Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cryptosystem based on Lucas Function is known as LUC Cryptosystems. Lucas Function is a special form of second order linear recurrence relation using a large public integer as a modulus. We are sure that, an existing computation technique will suffer a huge computations time and spaces when calculating a very large size of public-key and private-key. Recently, a method for fast LUC Cryptosystems computation on single processor has been proposed. In this paper, we extend the method in parallel on distributed memory multiprocessor machine using message-passing interface. We are generating a special sequence from a given value of public-key and private-key. This special sequence will be used to direct the computation of LUC. We examine the parallelism efficiency of the algorithm by analyze the simulation time and speedup.