Correcting Block Attack on the 32-bit Reduced NEEVA

NEEVA is a hash function algorithm with a sponge function structure. The algorithm is designed for sensor nodes on the Wireless Sensor Network (WSN). In this study, we employed the correcting block attack on the 32-bit Reduced NEEVA which is a simplification of the NEEVA algorithm. The attack aimed to find internal collisions of message sets and the combinations of message sets. The attack was carried out on 1 message block and 2 message blocks from the 32-bit Reduced NEEVA. The results showed that internal collisions and combination collisions were found in the 32-bit Reduced NEEVA algorithm. The search is performed by looking at each process in the f function of the first round in each correcting block and the f function of the last round. Collision arises due to the unbalanced Feistel process in the last round of function f on the 32-bit Reduced NEEVA. In addition, the modular addition process on the 32-bit Reduced NEEVA does not affect the collision found.