Design of Split Key Authentication Algorithm

Abstract

Multi-key authentication allowing users to establish a shared key is vital for authentication server because it acts an important role in providing secure transmission to avoid malicious attack. In order to reduce the risk of being attacked, researches have been carried out to search for effective and fast computation algorithm by using split-key or multi-key authentication. This project focuses on two main areas: i) to study the existing approaches and ii) to design a new robust authentication algorithm for solving this problem. An Elliptic Curve Cryptography (ECC) based algorithm with Diffie-Hellman key exchange (D-H) and with Data Fragmentation to provide reliable data transmission is proposed. A simulation is conducted using JAVA to simulate the implementation of this proposed algorithm. The simulation includes calculating the execution times of configuration, fragmentation, encryption, decryption and consolidation, and analyzing the performance of this algorithm. The results indicated that it reduces the possibility of a message being crypto-analyzed because of its extra complexity of recombination nature. This approach reduces the security risk of being attacked by both insiders (internal intruders) and outsiders (external intruders). The robustness is found to be proportional to the number of fragments being used and the only drawback is the increase of the computation time by a fraction.