An efficient computation technique for cryptosystems based on Lucas functions

• Main Authors: Md Ali, Zulkarnain, Othman, Mohamed, Md. Said, Mohamad Rushdan, Sulaiman, Md. Nasir
• Format: Conference or Workshop Item
• Language: English
• Published: IEEE 2008
• Online Access: http://psasir.upm.edu.my/id/eprint/69100/1/An%20efficient%20computation%20technique%20for%20cryptosystems%20based%20on%20Lucas%20functions.pdf; http://psasir.upm.edu.my/id/eprint/69100/

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.