Implementation SHA512 Hash Function And Boyer-Moore String Matching Algorithm For Jpeg/exif Message Digest Compilation

Rachmad Fitriyanto; Anton Yudhana; Sunardi Sunardi

doi:10.15575/join.v4i1.304

Authors

Rachmad Fitriyanto Magister of Informatics Engineering, Universitas Ahmad Dahlan, Yogyakarta, Indonesia
Anton Yudhana Electrical Engineering Department, Universitas Ahmad Dahlan, Yogyakarta, Indonesia
Sunardi Sunardi Electrical Engineering Department, Universitas Ahmad Dahlan, Yogyakarta, Indonesia

DOI:

https://doi.org/10.15575/join.v4i1.304

Keywords:

Message digest, JPEG/exif, SHA512, Hash value, Boyer-Moore

Abstract

Security information method for JPEG/exif documents generally aims to prevent security attacks by protecting documents with password and watermark. Both methods cannot be used to determine the condition of data integrity at the detection stage of the information security cycle. Message Digest is the essence of a file that has a function as a digital fingerprint to represent data integrity. This study aims to compile digital fingerprints to detect changes that occurred in JPEG / exif documents in information security. The research phase consists of five stages. The first stage, identification of the JPEG / exif document structure conducted using the Boyer-Moore string matching algorithm to find JPEG/exif segments location. The Second stage is segment content acquisition, conducted based on segment location and length obtained. The Third step, computing message digest for each segment using SHA512 hash function. Fourth stage, JPEG / exif document modification experiments to identified affected segments. The fifth stage is selecting and combining the hash value of the segment into the message digest. The obtained result shows the message digest for JPEG/exif documents composed of three hash values. The SOI segment hash value used to detect modifications for JPEG to png conversion and image editing. The APP1 hash value used to detect metadata editing. The SOF0 hash values use to detect modification for image recoloring, cropping and resizing — the combination from three hash values as JPEG/exif’s message digest.

References

Here are the references formatted neatly:

H. Wijayanto, I. Riadi, and Y. Prayudi, “Encryption EXIF Metadata for Protection Photographic Image of Copyright Piracy,” Int. J. Res. Comput. Commun. Technol., vol. 5, no. 5, 2016.

D. P. Gangwar and A. Pathania, “Authentication of Digital Image using Exif Metadata and Decoding Properties,” Int. J. Sci. Res. Comput. Sci. Eng. Inf. Technol., vol. 3, no. January, pp. 335–341, 2019.

L. Yuan and T. Ebrahimi, “Image Privacy Protection with Secure JPEG Transmorphing,” Inst. Eng. Technol. Journals, vol. 11, no. 9, pp. 1–8, 2017.

A. S. Sukarno, “Pengembangan Aplikasi Pengamanan Dokumen Digital Memanfaatkan Algoritma Advance Encryption Standard, RSA Digital Signature dan Invisible Watermarking,” Pros. Semin. Nas. Apl. Teknol. Inf. 2013, pp. 1–8, NaN-5022, 2013.

A. Chauhan, “Digital Watermarking-Revisit,” Int. J. Comput. Sci. Inf. Technol., vol. 6, no. 1, pp. 833–838, 2015.

D. Vaishnavi and T. S. Subashini, “A Secure and Robust Image Watermarking System Using Normalization and Arnold Scrambling,” Int. J. Netw. Secur., vol. 18, no. 5, pp. 832–841, 2017.

C. B. Shah and D. R. Panchal, “Secured Hash Algorithm-1: Review Paper,” Int. J. Adv. Res. Eng. Technol., vol. 2, no. 10, pp. 26–30, 2014.

N. Tiwari and A. Sinhal, “An Implementation on Secure Hash Algorithm in Wireless Algorithms to Ensure the Integrity,” Int. J. Comput. Sci. Inf. Technol., vol. 5, no. January, pp. 4779–4781, 2014.

N. C. Iyer and S. Mandal, “Implementation of Secure Hash Algorithm-1 using FPGA,” Int. J. Inf. Comput. Technol., vol. 3, no. 8, pp. 757–764, 2013.

NIST, FIPS PUB 180-4 Secure Hash Standard (SHS), no. August. Gaithersburg: National Institute of Standards and Technology, 2015.

I. Riadi and M. Sumagita, “Analysis of Secure Hash Algorithm (SHA) 512 for Encryption Process on Web Based Application,” Int. J. Cyber-Security Digit. Forensics, vol. 7, no. 4, 2018.

L. Refialy, E. Sediyono, and A. Setiawan, “Pengamanan Sertifikat Tanah Digital Menggunakan Digital Signature SHA-512,” JUTISI, vol. 1, pp. 229–234, 2015.

N. Jiji and T. Mahalakshmi, “Survey of Exact String Matching Algorithm for Detecting Patterns in Protein Sequence,” Adv. Comput. Sci. Technol., vol. 10, no. 8, pp. 2707–2720, 2017.

K. Al-Khamaiseh and S. Al-Shagarin, “A Survey of String Matching Algorithms,” Int. J. Eng. Res. Appl., vol. 4, no. June 2015, pp. 144–156, 2014.

R. Ramos-Fri and M. Vargas-Lombardo, “A Review of String Matching Algorithms and Recent Implementations using GPU,” Int. J. Secur. Its Appl., vol. 11, no. 6, pp. 69–76, 2017.

J. Bhandari and A. Kumar, “String Matching Rules Used By Variants of Boyer-Moore Algorithm,” J. Glob. Res. Comput. Sci., vol. 5, no. 1, pp. 8–11, 2014.

Y. D. Prabowo, “Pencocokan DNA NR_108049 dan DNA DI203322 Menggunakan Algoritma Boyer Moore,” Pros. Semin. Nas. Teknol. Inf. dan Komun., no. 40, pp. 18–19, 2016.

D. R. Candra and K. D. Tania, “Application of Knowledge Sharing Features Using the algorithm Boyer-moore On Knowledge Management System (KMS),” J. Sist. Inf., vol. 9

, no. 1, pp. 1216–1221, 2017.

A. L. Sandoval, D. M. Gonzales, L. J. Villaba, and J. Hernandez-Castro, “Analysis of errors in exif metadata on mobile devices,” Multimed Tools Appl, no. 74, pp. 4735–4763, 2015.

N. Jiji and T. Mahalaksmi, “An Efficient String Matching Algorithm for Detecting Pattern Using Forward and Backward Searching Approach,” Int. J. Comput. Sci., vol. 6, no. 2, pp. 16–26, 2018.