Reduce computation steps can increase the efficiency of computation algorithm

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)1203-1207
Number of pages5
JournalJournal of Computer Science
Volume6
Issue number10
DOIs
Publication statusPublished - 2010

Fingerprint

Cryptography

Keywords

  • Computation time
  • Efficiency of computation algorithm
  • LUC cryptosystem

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

Reduce computation steps can increase the efficiency of computation algorithm. / Md. Ali, Zulkarnain.

In: Journal of Computer Science, Vol. 6, No. 10, 2010, p. 1203-1207.

Research output: Contribution to journalArticle

@article{e5ffee532524473caf1fb49b58f5c656,
title = "Reduce computation steps can increase the efficiency of computation algorithm",
abstract = "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.",
keywords = "Computation time, Efficiency of computation algorithm, LUC cryptosystem",
author = "{Md. Ali}, Zulkarnain",
year = "2010",
doi = "10.3844/jcssp.2010.1203.1207",
language = "English",
volume = "6",
pages = "1203--1207",
journal = "Journal of Computer Science",
issn = "1549-3636",
publisher = "Science Publications",
number = "10",

}

TY - JOUR

T1 - Reduce computation steps can increase the efficiency of computation algorithm

AU - Md. Ali, Zulkarnain

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Computation time

KW - Efficiency of computation algorithm

KW - LUC cryptosystem

UR - http://www.scopus.com/inward/record.url?scp=78049471338&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049471338&partnerID=8YFLogxK

U2 - 10.3844/jcssp.2010.1203.1207

DO - 10.3844/jcssp.2010.1203.1207

M3 - Article

AN - SCOPUS:78049471338

VL - 6

SP - 1203

EP - 1207

JO - Journal of Computer Science

JF - Journal of Computer Science

SN - 1549-3636

IS - 10

ER -