By Topic

Computation of Cryptosystem based on Lucas Functions using Addition Chain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zulkarnain Md Ali ; Dept. of Computer Science, Faculty of, Technology and, Information Science, Universiti Kebangsaan, Malaysia, 43600 UKM, Bangi, Selangor, Malaysia ; Mohamed Othman ; Mohd Rushdan Muhd ; Md Nasir Sulaiman

Cryptosystem based on Lucas Functions is known as LUC Cryptosystem. Lucas Functions are the special form of second-order linear recurrence relation using a large public integer as modulus. In this paper, an efficient computation algorithm for LUC Cryptosystem is developed. It is based on Addition Chain. The computation time for existing and new algorithms will be recorded. Smaller computation time means the algorithm is efficient than the other. New technique shows a smaller computation time compared to the existing algorithm. It also increases the efficiency of computation. At the same time, it also reduces some iteration that is involved in LUC Cryptosystem computation.

Published in:

2010 International Symposium on Information Technology  (Volume:3 )

Date of Conference:

15-17 June 2010