An efficient method for improving the computational performance of the cubic lucas cryptosystem

Research output: Contribution to journalArticle

Abstract

The cubic version of the Lucas cryptosystem is set up based on the cubic recurrence relation of the Lucas function by Said and Loxton ['A cubic analogue of the RSA cryptosystem', Bull. Aust. Math. Soc. 68 (2003), 21-38]. To implement this type of cryptosystem in a limited environment, it is necessary to accelerate encryption and decryption procedures. Therefore, this paper concentrates on improving the computation time of encryption and decryption in cubic Lucas cryptosystems. The new algorithm is designed based on new properties of the cubic Lucas function and mathematical techniques. To illustrate the efficiency of our algorithm, an analysis was carried out with different size parameters and the performance of the proposed and previously existing algorithms was evaluated with experimental data and mathematical analysis.

Original languageEnglish
Pages (from-to)160-171
Number of pages12
JournalBulletin of the Australian Mathematical Society
Volume90
Issue number1
DOIs
Publication statusPublished - 2014

Fingerprint

Cryptosystem
Encryption
RSA Cryptosystem
Recurrence relation
Mathematical Analysis
Accelerate
Data analysis
Experimental Data
Analogue
Necessary

Keywords

  • cryptography
  • fast cryptography
  • Lucas cryptosystem
  • public key cryptosystem

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

@article{0b85b25a16ca4ff79a7384fbc27e8c65,
title = "An efficient method for improving the computational performance of the cubic lucas cryptosystem",
abstract = "The cubic version of the Lucas cryptosystem is set up based on the cubic recurrence relation of the Lucas function by Said and Loxton ['A cubic analogue of the RSA cryptosystem', Bull. Aust. Math. Soc. 68 (2003), 21-38]. To implement this type of cryptosystem in a limited environment, it is necessary to accelerate encryption and decryption procedures. Therefore, this paper concentrates on improving the computation time of encryption and decryption in cubic Lucas cryptosystems. The new algorithm is designed based on new properties of the cubic Lucas function and mathematical techniques. To illustrate the efficiency of our algorithm, an analysis was carried out with different size parameters and the performance of the proposed and previously existing algorithms was evaluated with experimental data and mathematical analysis.",
keywords = "cryptography, fast cryptography, Lucas cryptosystem, public key cryptosystem",
author = "Majid, {Reza Naghizadeh} and {A Sundararajan}, Elankovan and {Md. Ali}, Zulkarnain",
year = "2014",
doi = "10.1017/S000497271400001X",
language = "English",
volume = "90",
pages = "160--171",
journal = "Bulletin of the Australian Mathematical Society",
issn = "0004-9727",
publisher = "Cambridge University Press",
number = "1",

}

TY - JOUR

T1 - An efficient method for improving the computational performance of the cubic lucas cryptosystem

AU - Majid, Reza Naghizadeh

AU - A Sundararajan, Elankovan

AU - Md. Ali, Zulkarnain

PY - 2014

Y1 - 2014

N2 - The cubic version of the Lucas cryptosystem is set up based on the cubic recurrence relation of the Lucas function by Said and Loxton ['A cubic analogue of the RSA cryptosystem', Bull. Aust. Math. Soc. 68 (2003), 21-38]. To implement this type of cryptosystem in a limited environment, it is necessary to accelerate encryption and decryption procedures. Therefore, this paper concentrates on improving the computation time of encryption and decryption in cubic Lucas cryptosystems. The new algorithm is designed based on new properties of the cubic Lucas function and mathematical techniques. To illustrate the efficiency of our algorithm, an analysis was carried out with different size parameters and the performance of the proposed and previously existing algorithms was evaluated with experimental data and mathematical analysis.

AB - The cubic version of the Lucas cryptosystem is set up based on the cubic recurrence relation of the Lucas function by Said and Loxton ['A cubic analogue of the RSA cryptosystem', Bull. Aust. Math. Soc. 68 (2003), 21-38]. To implement this type of cryptosystem in a limited environment, it is necessary to accelerate encryption and decryption procedures. Therefore, this paper concentrates on improving the computation time of encryption and decryption in cubic Lucas cryptosystems. The new algorithm is designed based on new properties of the cubic Lucas function and mathematical techniques. To illustrate the efficiency of our algorithm, an analysis was carried out with different size parameters and the performance of the proposed and previously existing algorithms was evaluated with experimental data and mathematical analysis.

KW - cryptography

KW - fast cryptography

KW - Lucas cryptosystem

KW - public key cryptosystem

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

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

U2 - 10.1017/S000497271400001X

DO - 10.1017/S000497271400001X

M3 - Article

VL - 90

SP - 160

EP - 171

JO - Bulletin of the Australian Mathematical Society

JF - Bulletin of the Australian Mathematical Society

SN - 0004-9727

IS - 1

ER -