Parallel computation for luc cryptosystems on distributed memory multiprocessor machine

Zulkarnain Md. Ali, Mohamed Othman, Mohd Rushdan Muhd Said, Mohammad Nasir Sulaiman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationProceedings of the 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008
Pages43-48
Number of pages6
Publication statusPublished - 2008
Event4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008 - Langkawi
Duration: 2 Apr 20084 Apr 2008

Other

Other4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008
CityLangkawi
Period2/4/084/4/08

Fingerprint

Cryptography
Data storage equipment
Message passing
Interfaces (computer)

Keywords

  • Algorithm and computations Theories
  • Distributed and parallel computing
  • LUC cryptosystems

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Md. Ali, Z., Othman, M., Said, M. R. M., & Sulaiman, M. N. (2008). Parallel computation for luc cryptosystems on distributed memory multiprocessor machine. In Proceedings of the 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008 (pp. 43-48)

Parallel computation for luc cryptosystems on distributed memory multiprocessor machine. / Md. Ali, Zulkarnain; Othman, Mohamed; Said, Mohd Rushdan Muhd; Sulaiman, Mohammad Nasir.

Proceedings of the 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008. 2008. p. 43-48.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Md. Ali, Z, Othman, M, Said, MRM & Sulaiman, MN 2008, Parallel computation for luc cryptosystems on distributed memory multiprocessor machine. in Proceedings of the 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008. pp. 43-48, 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008, Langkawi, 2/4/08.
Md. Ali Z, Othman M, Said MRM, Sulaiman MN. Parallel computation for luc cryptosystems on distributed memory multiprocessor machine. In Proceedings of the 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008. 2008. p. 43-48
Md. Ali, Zulkarnain ; Othman, Mohamed ; Said, Mohd Rushdan Muhd ; Sulaiman, Mohammad Nasir. / Parallel computation for luc cryptosystems on distributed memory multiprocessor machine. Proceedings of the 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008. 2008. pp. 43-48
@inproceedings{fd3481b391b94f6aa1c894859498fd2b,
title = "Parallel computation for luc cryptosystems on distributed memory multiprocessor machine",
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.",
keywords = "Algorithm and computations Theories, Distributed and parallel computing, LUC cryptosystems",
author = "{Md. Ali}, Zulkarnain and Mohamed Othman and Said, {Mohd Rushdan Muhd} and Sulaiman, {Mohammad Nasir}",
year = "2008",
language = "English",
isbn = "9780889867307",
pages = "43--48",
booktitle = "Proceedings of the 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008",

}

TY - GEN

T1 - Parallel computation for luc cryptosystems on distributed memory multiprocessor machine

AU - Md. Ali, Zulkarnain

AU - Othman, Mohamed

AU - Said, Mohd Rushdan Muhd

AU - Sulaiman, Mohammad Nasir

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Algorithm and computations Theories

KW - Distributed and parallel computing

KW - LUC cryptosystems

UR - http://www.scopus.com/inward/record.url?scp=62649113882&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=62649113882&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:62649113882

SN - 9780889867307

SP - 43

EP - 48

BT - Proceedings of the 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008

ER -