Modify Twofish Algorithm to Lightweight using Present Techniques for Data Protection

Cryptography is required to transmit data over network communication channels to increase security and lower costs, and Twofish’s algorithm is suffer from the F-Function. It has two G-Function which is one of the complex operations in the original Twofish algorithm. To solve this problem, this paper modifies F-Function structure using the techniques of the Present algorithm, which is used to make the original algorithm better in the memory consumption, faster and better security. In this paper, propose two versions of Lightweight Twofish Algorithm: The first version is called (LTFA1) which includes modified F-function by replaced g-Function, PHT, and h-function with (permutation layer and S-box) technique found in the Present lightweight algorithm. A Second version is called (LTFA2) is keeping PHT – function in F-function and replaced g and h-Function with (permutation layer and S-box) technique in the Present algorithm. Experiments and results of the proposed algorithm based on NIST testing, security and lightweight measures (execution time, memory usage, and throughput) are shown that the proposed algorithms are safer and faster compared to the original algorithm.