### Abstract

Lucas Functions is a special form of second order linear recurrence relation. This function has been used in the LUC Cryptosystems. The encryption process of this system is the computations of V(e), while the decryption process is done by the computations of V(d). The V(e) and V(d) are both Lucas Function. The performances of computations of LUC are influence by the size of e and d. It is also depends on the size of message, M and two primes p and q. In the case of e, d, M, p and q are in a large number, we are sure that the existing algorithm would suffers a huge computations time and spaces. In this paper, we are presenting a new and efficient computations algorithm for LUC Cryptosystems. We have found that the binary sequence used in a new algorithm is shorter than a special sequence used in an existing algorithm. Once we get a generated binary sequence, we shall use this sequence to perform the LUC computations. We are examining the efficiency of this new algorithm by comparing the computation time with an existing algorithm.

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

Title of host publication | Proceedings of the International Conference on Computer and Communication Engineering 2008, ICCCE08: Global Links for Human Development |

Pages | 187-190 |

Number of pages | 4 |

DOIs | |

Publication status | Published - 2008 |

Event | International Conference on Computer and Communication Engineering 2008, ICCCE08: Global Links for Human Development - Kuala Lumpur Duration: 13 May 2008 → 15 May 2008 |

### Other

Other | International Conference on Computer and Communication Engineering 2008, ICCCE08: Global Links for Human Development |
---|---|

City | Kuala Lumpur |

Period | 13/5/08 → 15/5/08 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science Applications
- Human-Computer Interaction

### Cite this

*Proceedings of the International Conference on Computer and Communication Engineering 2008, ICCCE08: Global Links for Human Development*(pp. 187-190). [4580593] https://doi.org/10.1109/ICCCE.2008.4580593

**An efficient computation technique for cryptosystems based on Lucas Functions.** / Md. Ali, Zulkarnain; Othman, M.; Said, M. R M; Sulaiman, M. N.

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

*Proceedings of the International Conference on Computer and Communication Engineering 2008, ICCCE08: Global Links for Human Development.*, 4580593, pp. 187-190, International Conference on Computer and Communication Engineering 2008, ICCCE08: Global Links for Human Development, Kuala Lumpur, 13/5/08. https://doi.org/10.1109/ICCCE.2008.4580593

}

TY - GEN

T1 - An efficient computation technique for cryptosystems based on Lucas Functions

AU - Md. Ali, Zulkarnain

AU - Othman, M.

AU - Said, M. R M

AU - Sulaiman, M. N.

PY - 2008

Y1 - 2008

N2 - Lucas Functions is a special form of second order linear recurrence relation. This function has been used in the LUC Cryptosystems. The encryption process of this system is the computations of V(e), while the decryption process is done by the computations of V(d). The V(e) and V(d) are both Lucas Function. The performances of computations of LUC are influence by the size of e and d. It is also depends on the size of message, M and two primes p and q. In the case of e, d, M, p and q are in a large number, we are sure that the existing algorithm would suffers a huge computations time and spaces. In this paper, we are presenting a new and efficient computations algorithm for LUC Cryptosystems. We have found that the binary sequence used in a new algorithm is shorter than a special sequence used in an existing algorithm. Once we get a generated binary sequence, we shall use this sequence to perform the LUC computations. We are examining the efficiency of this new algorithm by comparing the computation time with an existing algorithm.

AB - Lucas Functions is a special form of second order linear recurrence relation. This function has been used in the LUC Cryptosystems. The encryption process of this system is the computations of V(e), while the decryption process is done by the computations of V(d). The V(e) and V(d) are both Lucas Function. The performances of computations of LUC are influence by the size of e and d. It is also depends on the size of message, M and two primes p and q. In the case of e, d, M, p and q are in a large number, we are sure that the existing algorithm would suffers a huge computations time and spaces. In this paper, we are presenting a new and efficient computations algorithm for LUC Cryptosystems. We have found that the binary sequence used in a new algorithm is shorter than a special sequence used in an existing algorithm. Once we get a generated binary sequence, we shall use this sequence to perform the LUC computations. We are examining the efficiency of this new algorithm by comparing the computation time with an existing algorithm.

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

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

U2 - 10.1109/ICCCE.2008.4580593

DO - 10.1109/ICCCE.2008.4580593

M3 - Conference contribution

SN - 9781424416929

SP - 187

EP - 190

BT - Proceedings of the International Conference on Computer and Communication Engineering 2008, ICCCE08: Global Links for Human Development

ER -