Document Security System Using Improved Hash Algorithm on Pre-processing Operation

Christine Charmaine G. San Jose

This paper is geared towards improving hash algorithm on pre-processing operation, conduct comparative analysis to other hashing algorithm and the development of a Document Security System (DSS) using the improved hash algorithm. Based on studies, the original hash algorithm displays weaknesses particularly on its pre-processing method. It is further suggested that there should be a modification to produce a strong cryptographic hash function. The pre-processing operation weaknesses was improved through integration of a new calculation (W0…15=S(0…15))(M0…15)⊕Y to a merely substitution of 32 bit word (W0...15 = M1…15) in the original operation. With these, the pre-processing had displayed a new value of sixteen 32 bit words. The message digests and final message digest formula was also improved that eventually contributed to a more complex calculation. This is very evident as it is shown on the results where the calculation of its avalanche effect is greater than its original algorithm with a difference of 1.04 percent. The developed Document Security System (DSS) using the improved hash algorithm was used to authenticate important documents sent on-line. It had benefited the agency in producing reliable and accurate information.

Volume 11 | 11-Special Issue

Pages: 972-978

DOI: 10.5373/JARDCS/V11SP11/20193123