DEVELOPMENT OF LIGHTWEIGHT HASH FUNCTION ALGORITHM BASED ON SPONGE CONSTRUCTION FOR CONSTRAINED DEVICES

• Main Author: Widhiara, Benardi
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/66700
• Institution: Institut Teknologi Bandung

Security has become one of the most important aspects of application considering the increasing number of cyber threats. Application security can be achieved by implementing conventional cryptography, such as hash function. Hash function has been used widely in many small computing devices, such as RFID. The implementation of conventional cryptography in RFID is no longer compatible because it requires big resources. Lightweight hash function emerges as the solution of the problem. RFID which implements hash function requires an algorithm with low computational time and good security. However, until today the lightweight hash function is under exploration and has not achieved maximum efficiency. In this research, we propose a new lightweight hash function algorithm as the solution of the problem mentioned before. DSRM is used in this research. The designing process begins with literature review about building construction of a hash function and permutation function from another lightweight hash function. Some decisions are made based on the literature review, such as sponge construction as the building construction, parameters of sponge construction such as size of state, rate, capacity, and output, iterated permutation function as the function of the sponge construction, and permutation function based on ARX-SPN structure. Designing process continues with designing the algorithm’s permutation function and phases of the sponge construction based on the previously decided parameters. After the designing process is done, the design of the algorithm is transformed into a source code and source code validation is conducted. Evaluation of the algorithm is done by evaluating the randomness of the function, security, and performance aspects. CRT such as SAC, Collision, and Coverage Test are used to evaluate the randomness of the algorithm. Security aspect is evaluated by implementing second preimage, collision, and preimage attack. Performance evaluation is conducted in software and hardware environments based on time processing and memory consumption aspects. Lightweight hash function, SPONGENT-88, is used as the comparing algorithm in the evaluation. The output of this research is a lightweight hash function that can be used in many small computing devices.