Computation of private key based on Divide-By-Prime for luc cryptosystems

Zulkarnain Md. Ali, Nawara Makhzoum Alhassan Makhzoum

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Problem statement: One of the public key cryptosystem is Luc cryptosystems. This system used Lucas Function for encryption and decryption process. Lucas Function is a special form of second-order linear recurrence relation. An encyption process is used to encrypt an original message to ciphertext by using public key. A decryption process is the process to decrypt a ciphertext into original message using private key. The existing algorithm on computing private key computation involved some redundant computations. Approach: In this study, an efficient algorithm to compute private key for Luc cryptosystem is developed. The Extended Euclidean Algorithm will be enhanced by implementing Divide-By-Prime in its computations. The comparison is focused on the computation time by the existing and new algorithms. The more efficient algorithm means the better computation time. The shorter computation time the better algorithm. Results: A new algorithm shows better computation time. In all experiments, the computation time by new algorithm is always better than the existing algorithm. Conclusion: The new computation algorithm that based on Divide-By-Prime provided better efficiency of decryption process compared to the existing algorithm.

Original languageEnglish
Pages (from-to)523-527
Number of pages5
JournalJournal of Computer Science
Volume8
Issue number4
DOIs
Publication statusPublished - 2012

Fingerprint

Cryptography
Computer systems

Keywords

  • Decryption process
  • Luc cryptosystem
  • Private key

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

Computation of private key based on Divide-By-Prime for luc cryptosystems. / Md. Ali, Zulkarnain; Makhzoum, Nawara Makhzoum Alhassan.

In: Journal of Computer Science, Vol. 8, No. 4, 2012, p. 523-527.

Research output: Contribution to journalArticle

Md. Ali, Zulkarnain ; Makhzoum, Nawara Makhzoum Alhassan. / Computation of private key based on Divide-By-Prime for luc cryptosystems. In: Journal of Computer Science. 2012 ; Vol. 8, No. 4. pp. 523-527.
@article{842a96d2326a4e279075ab0571aca2c5,
title = "Computation of private key based on Divide-By-Prime for luc cryptosystems",
abstract = "Problem statement: One of the public key cryptosystem is Luc cryptosystems. This system used Lucas Function for encryption and decryption process. Lucas Function is a special form of second-order linear recurrence relation. An encyption process is used to encrypt an original message to ciphertext by using public key. A decryption process is the process to decrypt a ciphertext into original message using private key. The existing algorithm on computing private key computation involved some redundant computations. Approach: In this study, an efficient algorithm to compute private key for Luc cryptosystem is developed. The Extended Euclidean Algorithm will be enhanced by implementing Divide-By-Prime in its computations. The comparison is focused on the computation time by the existing and new algorithms. The more efficient algorithm means the better computation time. The shorter computation time the better algorithm. Results: A new algorithm shows better computation time. In all experiments, the computation time by new algorithm is always better than the existing algorithm. Conclusion: The new computation algorithm that based on Divide-By-Prime provided better efficiency of decryption process compared to the existing algorithm.",
keywords = "Decryption process, Luc cryptosystem, Private key",
author = "{Md. Ali}, Zulkarnain and Makhzoum, {Nawara Makhzoum Alhassan}",
year = "2012",
doi = "10.3844/jcssp.2012.523.527",
language = "English",
volume = "8",
pages = "523--527",
journal = "Journal of Computer Science",
issn = "1549-3636",
publisher = "Science Publications",
number = "4",

}

TY - JOUR

T1 - Computation of private key based on Divide-By-Prime for luc cryptosystems

AU - Md. Ali, Zulkarnain

AU - Makhzoum, Nawara Makhzoum Alhassan

PY - 2012

Y1 - 2012

N2 - Problem statement: One of the public key cryptosystem is Luc cryptosystems. This system used Lucas Function for encryption and decryption process. Lucas Function is a special form of second-order linear recurrence relation. An encyption process is used to encrypt an original message to ciphertext by using public key. A decryption process is the process to decrypt a ciphertext into original message using private key. The existing algorithm on computing private key computation involved some redundant computations. Approach: In this study, an efficient algorithm to compute private key for Luc cryptosystem is developed. The Extended Euclidean Algorithm will be enhanced by implementing Divide-By-Prime in its computations. The comparison is focused on the computation time by the existing and new algorithms. The more efficient algorithm means the better computation time. The shorter computation time the better algorithm. Results: A new algorithm shows better computation time. In all experiments, the computation time by new algorithm is always better than the existing algorithm. Conclusion: The new computation algorithm that based on Divide-By-Prime provided better efficiency of decryption process compared to the existing algorithm.

AB - Problem statement: One of the public key cryptosystem is Luc cryptosystems. This system used Lucas Function for encryption and decryption process. Lucas Function is a special form of second-order linear recurrence relation. An encyption process is used to encrypt an original message to ciphertext by using public key. A decryption process is the process to decrypt a ciphertext into original message using private key. The existing algorithm on computing private key computation involved some redundant computations. Approach: In this study, an efficient algorithm to compute private key for Luc cryptosystem is developed. The Extended Euclidean Algorithm will be enhanced by implementing Divide-By-Prime in its computations. The comparison is focused on the computation time by the existing and new algorithms. The more efficient algorithm means the better computation time. The shorter computation time the better algorithm. Results: A new algorithm shows better computation time. In all experiments, the computation time by new algorithm is always better than the existing algorithm. Conclusion: The new computation algorithm that based on Divide-By-Prime provided better efficiency of decryption process compared to the existing algorithm.

KW - Decryption process

KW - Luc cryptosystem

KW - Private key

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

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

U2 - 10.3844/jcssp.2012.523.527

DO - 10.3844/jcssp.2012.523.527

M3 - Article

AN - SCOPUS:84856759254

VL - 8

SP - 523

EP - 527

JO - Journal of Computer Science

JF - Journal of Computer Science

SN - 1549-3636

IS - 4

ER -