Reduce Computation Steps Can Increase the Efficiency of Computation Algorithm
Zulkarnain Md. Ali
DOI : 10.3844/jcssp.2010.1203.1207
Journal of Computer Science
Volume 6, Issue 10
Problem statement: Lucas function is a special form of second-order linear recurrence relation. It is used in LUC cryptosystems. The performance of LUC cryptosystem depends on the size of public key, messages and two relatively primes. The increasing of size of these parameters will increase the computation time need to perform the LUC Cryptosystem computation. The efficiency means the quality to avoid wasted time. Approach: Therefore, the main theme of this study was to design and implement an improve version of computation algorithm. The efficiency of computation can skip some computations time for a computerized calculation. Smaller computation time means the algorithm is better and more efficient than the other algorithm. In this study, the technique on reducing redundant number of computations steps in LUC Cryptosystem was investigated. The use of two variables w and t were proposed in order to reduce some computations steps in LUC Cryptosystem computation. Results: The new technique showed a better computation time compared to the existing algorithm. It also reduced some redundant multiplications without sacrificed the security of LUC Cryptosystem. At the same time, it increases the efficiency of computation algorithm. Conclusion: The proposed algorithm showed better speed and efficiency by reducing some redundant computation steps. It can reduce up to 20% of computation efforts compare to the existing one.
© 2010 Zulkarnain Md. Ali. 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.