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

Authors

  • R. N. Majid Computer Science Program, Faculty of Information Science and Technology, University Kebangsaan Malaysia
  • E. Sundararajan Information Technology Program, Faculty of Information Science and Technology, University Kebangsaan Malaysia
  • Z. M. Ali Computer Science Program, Faculty of Information Science and Technology, University Kebangsaan Malaysia

Keywords:

Cryptography, public key cryptosystem, fast cryptography, 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]. For implementing this type of cryptosystem in limited environment, it needs 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 the new properties of 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. DOI: 10.1017/S000497271400001X

Published

2014-06-03

Issue

Section

Articles