Repository Universitas Gunadarma >
E-Journal Komputer >
Please use this identifier to cite or link to this item:
|Title: ||Two Fast Computation Algorithms for LUC Cryptosystems|
|Authors: ||M. Ali, Z.|
R.M Said, M.
N. Sulaiman, M.
|Issue Date: ||17-Jun-2007|
|Publisher: ||Proceedings of the International Conference on Electrical Engineering and Informatics|
|Series/Report no.: ||C-16;|
|Abstract: ||Most of public-key cryptosystems are based on one-way functions, which can be used to encrypt and sign messages. Among them,
probably the most promising and widely used is the encryption and signature operations are based on the computation of
exponentiation (as in the RSA). Another public-key cryptosystems are proposed and based on Lucas Functions which was known as
LUC cryptosystems. The Lucas Functions is a special form of second-order linear recurrence relation using a large public integer as
the modulus. The performances of its computations are influence by computation of Ve and Vd, the public and private keys process,
respectively. In this paper, we are presenting two fast computation algorithms for LUC cryptosystems. We are manipulated some
properties of Lucas Functions relationships by introducing two different sequences. These sequences will provide an efficient
technique to compute LUC cryptosystems. In order to compare the efficiency of each algorithm, we show computation time for each
|Appears in Collections:||E-Journal Komputer|
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.