### Abstract

LUC Cryptosystem is a public key cryptosystem based on Lucas Function. It is first discussed by Smith and Lennon in 1993. They proposed a new public key system using Lucas Function instead of using exponentiation based as found in RSA. Lucas Function is the second order linear recurrence relation. The computation of LUC Cryptosystem is based on the computation of Lucas Function. Many of the existing computation algorithms for Lucas Function are suitable for one processor and there is no problem to design a computation algorithm for one processor as the Lucas Function can be implemented directly into programming codes. In this paper, the Binary Numbers will be used as a technique for parallel computation algorithm. The encryption process using V_{e}(P,1)(mod N) to get ciphertext, C from plaintext, P. While the decryption used V_{d}(C,1)(mod N) to get P from C. Meanwhile N is the product of two relatively primes p and q. In this case, the public key e (usually in decimal numbers) will be converted to the Binary Numbers. Then, this number will be use in manipulating the Lucas Functions properties such as V_{2n}, V_{2n+1} and V_{2n-1} to find the fast computation techniques for Lucas Functions. Both processes run on special distributed memory multiprocessors machine known as Sun Fire V1280. The proposed techniques can reduce a computation time for LUC Cryptosystem computation compare to the computation algorithm for one processor. As a comparison, the computation time for one processor and several numbers of processors are also included.

Original language | English |
---|---|

Pages (from-to) | 12-21 |

Number of pages | 10 |

Journal | Journal of Theoretical and Applied Information Technology |

Volume | 44 |

Issue number | 1 |

Publication status | Published - 2012 |

### Fingerprint

### Keywords

- Binary Numbers
- Distributed Memory Multiprocessors Machine
- LUC Cryptosystems
- Lucas Functions
- Parallel Algorithm

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

**Parallel computation algorithm for luc cryptosystem based on binary number.** / Md. Ali, Zulkarnain.

Research output: Contribution to journal › Article

*Journal of Theoretical and Applied Information Technology*, vol. 44, no. 1, pp. 12-21.

}

TY - JOUR

T1 - Parallel computation algorithm for luc cryptosystem based on binary number

AU - Md. Ali, Zulkarnain

PY - 2012

Y1 - 2012

N2 - LUC Cryptosystem is a public key cryptosystem based on Lucas Function. It is first discussed by Smith and Lennon in 1993. They proposed a new public key system using Lucas Function instead of using exponentiation based as found in RSA. Lucas Function is the second order linear recurrence relation. The computation of LUC Cryptosystem is based on the computation of Lucas Function. Many of the existing computation algorithms for Lucas Function are suitable for one processor and there is no problem to design a computation algorithm for one processor as the Lucas Function can be implemented directly into programming codes. In this paper, the Binary Numbers will be used as a technique for parallel computation algorithm. The encryption process using Ve(P,1)(mod N) to get ciphertext, C from plaintext, P. While the decryption used Vd(C,1)(mod N) to get P from C. Meanwhile N is the product of two relatively primes p and q. In this case, the public key e (usually in decimal numbers) will be converted to the Binary Numbers. Then, this number will be use in manipulating the Lucas Functions properties such as V2n, V2n+1 and V2n-1 to find the fast computation techniques for Lucas Functions. Both processes run on special distributed memory multiprocessors machine known as Sun Fire V1280. The proposed techniques can reduce a computation time for LUC Cryptosystem computation compare to the computation algorithm for one processor. As a comparison, the computation time for one processor and several numbers of processors are also included.

AB - LUC Cryptosystem is a public key cryptosystem based on Lucas Function. It is first discussed by Smith and Lennon in 1993. They proposed a new public key system using Lucas Function instead of using exponentiation based as found in RSA. Lucas Function is the second order linear recurrence relation. The computation of LUC Cryptosystem is based on the computation of Lucas Function. Many of the existing computation algorithms for Lucas Function are suitable for one processor and there is no problem to design a computation algorithm for one processor as the Lucas Function can be implemented directly into programming codes. In this paper, the Binary Numbers will be used as a technique for parallel computation algorithm. The encryption process using Ve(P,1)(mod N) to get ciphertext, C from plaintext, P. While the decryption used Vd(C,1)(mod N) to get P from C. Meanwhile N is the product of two relatively primes p and q. In this case, the public key e (usually in decimal numbers) will be converted to the Binary Numbers. Then, this number will be use in manipulating the Lucas Functions properties such as V2n, V2n+1 and V2n-1 to find the fast computation techniques for Lucas Functions. Both processes run on special distributed memory multiprocessors machine known as Sun Fire V1280. The proposed techniques can reduce a computation time for LUC Cryptosystem computation compare to the computation algorithm for one processor. As a comparison, the computation time for one processor and several numbers of processors are also included.

KW - Binary Numbers

KW - Distributed Memory Multiprocessors Machine

KW - LUC Cryptosystems

KW - Lucas Functions

KW - Parallel Algorithm

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

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

M3 - Article

AN - SCOPUS:84867825821

VL - 44

SP - 12

EP - 21

JO - Journal of Theoretical and Applied Information Technology

JF - Journal of Theoretical and Applied Information Technology

SN - 1992-8645

IS - 1

ER -