Citation
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.
Download File
Full text not available from this repository.
|
Additional Metadata
Item Type: | Article |
---|---|
Divisions: | Faculty of Computer Science and Information Technology Faculty of Science Institute for Mathematical Research |
DOI Number: | https://doi.org/10.3844/jcssp.2008.1056.1060 |
Publisher: | Science Publications |
Keywords: | Cryptography; Computation algorithm |
Depositing User: | Nurul Ainie Mokhtar |
Date Deposited: | 29 May 2015 06:50 |
Last Modified: | 29 May 2015 06:50 |
Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.3844/jcssp.2008.1056.1060 |
URI: | http://psasir.upm.edu.my/id/eprint/12741 |
Statistic Details: | View Download Statistic |
Actions (login required)
View Item |