Zulkarnain Md Ali

National University of Malaysia, Kuala Lumpur, Kuala Lumpur, Malaysia

Are you Zulkarnain Md Ali?

Claim your profile

Publications (3)0 Total impact

  • Conference Proceeding: A simple library and basic code for LUC Cryptosystem computation
    [show abstract] [hide abstract]
    ABSTRACT: The LUC Cryptosystem is one of public key cryptosystem. Both encryption and decryption process will use Lucas Function as its computation technique. At the moment, we are already developed a fast computation techniques for LUC Cryptosystem. The comparisons of the techniques are done by an analysis on its computation technique and computation time. In this paper, we are concentrating on using C language as our main programming language when we design proposed algorithms. To support the suitable C codes for that algorithm, we will design our own C library. Therefore, we will show a simple C library and its suitable codes that could represent the algorithm. We will also show the effectiveness of this library and its limitation that can be improved later.
    Information Technology, 2008. ITSim 2008. International Symposium on; 09/2008
  • Conference Proceeding: Implementation of Parallel Algorithms for LUC Cryptosystem
    [show abstract] [hide abstract]
    ABSTRACT: The encryption process of LUC Cryptosystem is V<sub>e</sub>(P,1)(mod N), while the decryption process is V<sub>d</sub>(C,1)(mod N). An N is a product of two relatively primes p and q, P is a message and C is the ciphertext. To compute V<sub>e</sub> and V<sub>d</sub>, this system used Lucas Function. The Lucas Functions is a special form of second order linear recurrence relation using a large public integer. Recently, methods for fast LUC Cryptosystem computation in sequential and parallel techniques have been developed. We are introducing an important property of Lucas Function, V<sub>2n+1</sub>=PV<sub>2n</sub>-QV<sub>2n-1</sub>. This property could increase the performance of LUC Cryptosystem computation and reduce the computation time. We are implementing the method in parallel on distributed memory multiprocessor machine using message passing interface. In order to show a new parallel solution is better than the previous parallel solution; we will compare the simulation time, speedup and efficiency of both solutions.
    Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008. SNPD '08. Ninth ACIS International Conference on; 09/2008
  • Article: A New Computation Algorithm for a Cryptosystem Based on Lucas Functions
    [show abstract] [hide abstract]
    ABSTRACT: Most of public-key cryptosystems rely on one-way functions. The cryptosystems can be used to encrypt and sign messages. The LUC Cryptosystem is a cryptosystem based on Lucas Functions. The encryption process used a public key which was known publicly and the decryption used a private key which was known only by sender and receiver of the messages. The performance of LUC cryptosystem computation influenced by computation of Ve the public key process and Vd the private key process. Very large scales of computations and timing overhead involved for large values of e and d. We are presenting the so-called Doubling with Remainder compared to the existing technique. It shows better performance in LUC computations by reducing time consumed in its computations. The experimental results of existing and new algorithm are included.
    Journal of Computer Science. 01/2008;