Zulkarnain Md Ali

Implementation of Parallel Algorithms for LUC Cryptosystem

The encryption process of LUC Cryptosystem is Ve(P,1)(mod N), while the decryption process is Vd(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 Ve and Vd, 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, V2n+1=PV2n-QV2n-1. 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.

The enhancement of computation technique by combining RSA and El-Gamal Cryptosystems

Cryptography addresses the necessary elements for secure communication such as privacy, confidentiality, key exchange, authentication, and non-repudiation. This paper proposes a model satisfies the security based on the combination of the RSA and El-Gamal Cryptosystems. The RSA Cryptosystem is depends on the Integer Factorization Problem (IFP), while the El-Gamal Cryptosystem depends on Discrete Logarithm Problem (DLP). This model works on the basis of merging between IFP with DLP give a good speed of computation for asymmetric cryptosystem based on difficulties of the solutions of two famous hard problems. As a result, the computation of the proposed system is more efficient compared to El-Gamal algorithm and RSA algorithm.

Computation of private key for LUC Cryptosystem

LUC Cryptosystem is a public key cryptosystem based on Lucas Functions. The encryption of this cryptosystem is relatively easy since we have the knowledge of public key e, two primes p and q and also the message M. Meanwhile, decryption process is difficult without the knowledge of private key d. In this paper, we are presenting a technique that can be used to compute private key for LUC Cryptosystem. It is based on the existing number theory techniques. The computation of private key is possible because we know values of two primes p, q and ciphertext C. The size of two primes is important that determined the size of private key.

Computation of Cryptosystem based on Lucas Functions using Addition Chain

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.

Web Vulnerability Assessment: Outsource dilemmas

Vulnerability Assessment (VAS) is a process to search for any potential loopholes contain in a system that lead to compromise it. It is important to do VAS on the system to make sure that it will be safely release and not offer any illegitimate access that can affect availability, confidentiality and integrity of the system[1][12]. VAS can be done by out sourcing it to a third party or do it yourself (DIY) depending on the budget and time allocated. It can sometimes depend on the confidentiality of the project that might pretend you from open it for a third party assessment. By choosing DIY, another thing to consider is implementing the VAS as in standard and common practices to make sure that the system can pass the security requirements needed. Even though there are so many standards, testing guidelines and common practices for VAS that is available on the net, the process of selecting the best and suitable VAS approach will need you to sacrifice a lot of your time and effort. This paper tries to share some experiences in setting up some criteria for outsourcing the task. It also shares the way to simplify standard practise from Open Web Application Security Project (OWASP) and turning it into simple practice yet thorough assessment process. The assessment was done in a clone environment to protect the real system from any disruptions and conflict.

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

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

A simple library and basic code for LUC Cryptosystem computation

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.