A New Computation Algorithm for a Cryptosystem Based on Lucas Functions
Abstract
Most of public-key cryptosystems rely on one-way functions. The cryptosystems can be used to encrypt and sign messages. The LUC Cryptosystem is a cryptosystem based on Lucas Functions. The encryption process used a public key which was known publicly and the decryption used a private key which was known only by sender and receiver of the messages. The performance of LUC cryptosystem computation influenced by computation of Ve the public key process and Vd the private key process. Very large scales of computations and timing overhead involved for large values of e and d. We are presenting the so-called Doubling with Remainder compared to the existing technique. It shows better performance in LUC computations by reducing time consumed in its computations. The experimental results of existing and new algorithm are included.
DOI: https://doi.org/10.3844/jcssp.2008.1056.1060
Copyright: © 2008 Mohamed Othman, Esam M. Abulhirat, Zulkarnain Md Ali, Mohd Rushdan Mohd Said and Rozita Johari. This is an open access article distributed under the terms of the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 3,091 Views
- 2,804 Downloads
- 1 Citations
Download
Keywords
- Cryptography
- Computation algorithm