### 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 language | English |
---|---|

Title of host publication | Proceedings of the 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008 |

Pages | 43-48 |

Number of pages | 6 |

Publication status | Published - 2008 |

Event | 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008 - Langkawi Duration: 2 Apr 2008 → 4 Apr 2008 |

### Other

Other | 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008 |
---|---|

City | Langkawi |

Period | 2/4/08 → 4/4/08 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Computer Science(all)

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

}

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 -