Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T19:56:25.250Z Has data issue: false hasContentIssue false

AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM

Published online by Cambridge University Press:  10 April 2014

REZA NAGHIZADEH MAJID*
Affiliation:
Computer Science Program, Faculty of Information Science and Technology, University Kebangsaan, Malaysia email r.naghizade@gmail.com
ELANKOVAN SUNDARARAJAN
Affiliation:
Information Technology Program, Faculty of Information Science and Technology, University Kebangsaan, Malaysia email elankovan.sundararajan@gmail.com
ZULKARNAIN MD ALI
Affiliation:
Computer Science Program, Faculty of Information Science and Technology, University Kebangsaan, Malaysia email zulkarnainmdali@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

MSC classification

Information

Type
Research Article
Copyright
Copyright © 2014 Australian Mathematical Publishing Association Inc.