scholarly journals Manajemen jpeg/exif file fingerprint dengan algoritma Brute Force string matching dan Hash Function SHA256

2019 ◽  
Vol 5 (2) ◽  
pp. 140
Author(s):  
Rachmad Fitriyanto ◽  
Anton Yudhana ◽  
Sunardi Sunardi
Keyword(s):  
Digital Signature ◽  
Hash Function ◽  
String Matching ◽  
Data Integrity ◽  
Brute Force ◽  
Matching Algorithm ◽  
Digital Signature Algorithm ◽  
Image Segment ◽  
Metadata File ◽  
Fourth Step

Management of jpeg/exif file fingerprint with Brute Force string matching algorithm and Hash Function SHA256Metode pengamanan berkas gambar jpeg/exif saat ini hanya mencakup aspek pencegahan, belum pada aspek deteksi integritas data. Digital Signature Algorithm (DSA) adalah metode kriptografi yang digunakan untuk memverifikasi integritas data menggunakan hash value. SHA256 merupakan hash function yang menghasilkan 256-bit hash value yang berfungsi sebagai file fingerprint. Penelitian ini bertujuan untuk menyusun file fingerprint dari berkas jpeg/exif menggunakan SHA256 dan algoritma Brute Force string matching untuk verifikasi integritas berkas jpeg/exif. Penelitian dilakukan dalam lima tahap. Tahap pertama adalah identifikasi struktur berkas jpeg/exif. Tahap kedua adalah akuisisi konten segmen. Tahap ketiga penghitungan hash value. Tahap keempat adalah eksperimen modifikasi berkas jpeg/exif. Tahap kelima adalah pemilihan elemen dan penyusunan file fingerprint. Hasil penelitian menunjukkan sebuah jpeg/exif file fingerprint tersusun atas tiga hash value. SOI (Start of Image) segment hash value digunakan untuk mendeteksi terjadinya modifikasi berkas dalam bentuk perubahan tipe berkas dan penambahan objek pada konten gambar. Hash value segmen APP1 digunakan untuk mendeteksi modifikasi pada metadata berkas. Hash value segmen SOF0 digunakan untuk mendeteksi gambar yang dimodifikasi dengan teknik recoloring, resizing, dan cropping. The method of securing jpeg/exif image files currently has covered only the prevention aspect instead of the data integrity detection aspect. Digital Signature Algorithm is a cryptographic method used to verify the data integrity using hash value. SHA256 is a hash function that produces a 256-bit hash value functioning as a fingerprint file. This study aimed at compiling fingerprint files from jpeg/exif files using SHA256 and Brute Force string matching algorithm to verify the integrity of jpeg/exif files. The research was conducted in five steps. The first step was identifying the jpeg/exif file structure. The second step was the acquisition of the segment content. The third step was calculating the hash value. The fourth step was the jpeg/exif file modification experiment. The fifth step was the selection of elements and compilation of fingerprint files. The obtained results showed a jpeg/exif fingerprint file which was compiled in three hash values. The hash value of SOI segment was used to detect the occurrence of file modification in the form of file type changing and object addition on the image content. The hash value of APP1 segment was used to detect the metadata file modification. The hash value of SOF0 segment was used to detect the images modified by recoloring, resizing, and cropping techniques.

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

2019 ◽  
Vol 4 (1) ◽  
pp. 16
Author(s):  
Rachmad Fitriyanto ◽  
Anton Yudhana ◽  
Sunardi Sunardi
Keyword(s):  
Information Security ◽  
Hash Function ◽  
String Matching ◽  
Data Integrity ◽  
Matching Algorithm ◽  
Document Structure ◽  
Digital Fingerprint ◽  
Content Acquisition ◽  
Detection Stage ◽  
Message Digest

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.

scholarly journals Boyer-Moore String Matching Algorithm and SHA512 Implementation for Jpeg/exif File Fingerprint Compilation in DSA

2020 ◽  
Vol 7 (1) ◽  
pp. 1-9
Author(s):  
Rachmad Fitriyanto ◽  
Anton Yudhana ◽  
Sunardi Sunardi
Keyword(s):  
Technology Development ◽  
String Matching ◽  
Digital Camera ◽  
Data Integrity ◽  
Structure Identification ◽  
Type Conversion ◽  
Image Resizing ◽  
Matching Algorithm ◽  
Image File ◽  
Digital Signature Algorithm

Data integrity, authenticity and non-repudiation are security parameters that provided by Digital Signature Algorithm (DSA). Hash value is important element inside DSA to identify information data integrity using hash function to generate message digest. Jpeg/exif is image file format that produce by digital camera as in smartphone. Hardware technology development made image file have higher resolution than before. This condition made image file fingerprinting need more time to compile jpeg/exif fingerprint. This research purpose is to develop fingerprinting process for jpeg/exif file using Boyer-Moore string matching algorithm and SHA512. Research conducted in four stages. First stage is jpeg/exif file structure identification, second stage is segment content acquisition and hashing, third stage is image file modification experiments and last stage is jpeg/exif file fingerprint compilation. Obtained result shown that jpeg/exif file fingerprint comprises of three hash value from SOI segment, APP1 segment and SOF0 segment. The jpeg/exif file fingerprint can use to detect six types image modification there are image resizing, text addition, metadata modification, image resizing, image cropping and file file type conversion.

scholarly journals Perbandingan Algoritma Boyer-Moore dan Brute Force pada Pencarian Kamus Besar Bahasa Indonesia Berbasis Android

2021 ◽  
Vol 1 (2) ◽  
pp. 54-60
Author(s):  
Candra Irawan ◽  
Mudafiq Riyan Pratama
Keyword(s):  
String Matching ◽  
Search Process ◽  
Brute Force ◽  
Text Search ◽  
Matching Algorithm ◽  
Running Time ◽  
The Right ◽  
Bahasa Indonesia ◽  
Testing Criteria

String matching is an algorithm for matching a text to another text or also known as a text search. There are several algorithms that can be used for string matching, including the Boyer-Moore algorithm and the Brute Force algorithm. The Boyer-Moore algorithm is a string matching algorithm published by Robert S. Boyer and J. Strother Moore in 1977. This algorithm is considered the most efficient algorithm in general applications. The Boyer-Moore algorithm starts matching characters from the pattern on the right. While the Brute Force algorithm is an algorithm that matches a pattern with all text between 0 and n-m to find the existence of a pattern in the text. These two algorithms have different patterns in the search process. In this article, a comparative analysis of the performance of the Boyer-Moore and Brute Force algorithms is carried out in a case study of the search for the Big Indonesian Dictionary (KBBI) based on Android. The search process is carried out by searching based on words and word descriptions. The results of this study indicate that the criteria for running time, the Brute Force algorithm is faster than the Boyer-Moore algorithm with the total running time of the Brute Force algorithm is 168.3 ms in words, 6994.16 ms in word descriptions, while the Boyer-Moore algorithm for running time reached 304.7 ms on the word, 8654.77 ms on the word description. In the testing criteria based on related keywords, the two algorithms can display the same list of related keywords.

A Secure Cloud Based Digital Signature Application for IoT

2018 ◽  
Vol 10 (3) ◽  
pp. 42-60 ◽  
Author(s):  
Sahar A. El-Rahman ◽  
Daniyah Aldawsari ◽  
Mona Aldosari ◽  
Omaimah Alrashed ◽  
Ghadeer Alsubaie
Keyword(s):  
Internet Of Things ◽  
Elliptic Curve ◽  
Digital Signature ◽  
Mobile Application ◽  
Hash Function ◽  
Advanced Encryption Standard ◽  
Cloud Environment ◽  
Electronic Documents ◽  
Message Source ◽  
Digital Signature Algorithm

IoT (Internet of Things) is regarded as a diversified science and utilization with uncommon risks and opportunities of business. So, in this article, a digital signature mobile application (SignOn) is presented where, it provides a cloud based digital signature with a high security to sustain with the growth of IoT and the speed of the life. Different algorithms were utilized to accomplish the integrity of the documents, authenticate users with their unique signatures, and encrypt their documents in order to provide the best adopted solution for cloud-based signature in the field of IoT. Where, ECDSA (Elliptic Curve Digital Signature Algorithm) is utilized to ensure the message source, Hash function (SHA-512) is used to detect all information variations, and AES (Advanced Encryption Standard) is utilized for more security. SignOn is considered as a legal obligated way of signing contracts and documents, keeping the data in electronic form in a secure cloud environment and shortens the duration of the signing process. Whereas, it allows the user to sign electronic documents and then, the verifier can validate the produced signature.

scholarly journals Boyer-Moore String Matching Algorithm and SHA512 Implementation for Jpeg/exif File Fingerprint Compilation in DSA

2020 ◽  
Vol 8 (1) ◽  
pp. 1
Author(s):  
Rachmad Fitriyanto ◽  
Anton Yudhana ◽  
Sunardi Sunardi
Keyword(s):  
Information Security ◽  
String Matching ◽  
Digital Camera ◽  
Type Conversion ◽  
Image Resizing ◽  
Matching Algorithm ◽  
Digital Signature Algorithm ◽  
Content Acquisition ◽  
Third Stage ◽  
File Structure

The jpeg/exif is file’s format for image produced by digital camera such as in the smartphones. The security method for jpeg/exif usages in digital communication currently only full-fill prevention aspect from three aspects of information security, prevention, detection and response. Digital Signature Algorithm (DSA) is a cryptographic method that provide detection aspect of information security by using hash-value as fingerprint of digital documents. The purpose of this research is to compile jpeg/exif file data fingerprint using the hash-value from DSA. The research conducted in four stages. The first stages is the identification of jpeg/exif file structure using Boyer-Moore string matching algorithm to locate the position of file’s segments. The second stage is segment’s content acquisition. The third stage the image files modification experiments to select the suitable element of jpeg/exif file data fingerprint. The fourth stage is the compilation of hash-values to form data fingerprint. The Obtained result has shown that the jpeg/exif file fingerprint comprises three hash value from the SOI segment, APP1's segment, and the SOF0 segment. The jpeg/exif file fingerprint can use for modified image detection, include six types of image modification there are image resizing, text addition, metadata modification, image resizing, image cropping and file type conversion

scholarly journals Data Integrity and Security using Keccak and Digital Signature Algorithm (DSA)

2019 ◽  
Vol 13 (3) ◽  
pp. 273
Author(s):  
Muhammad Asghar Nazal ◽  
Reza Pulungan ◽  
Mardhani Riasetiawan
Keyword(s):  
Digital Signature ◽  
Data Security ◽  
Hash Function ◽  
Digital Signatures ◽  
Literature Study ◽  
Data Verification ◽  
Digital Signature Algorithm ◽  
Hash Algorithm ◽  
Secure Hash Algorithm ◽  
Better Than

Data security is a very important compilation using cloud computing; one of the research that is running and using cloud technology as a means of storage is G-Connect. One of the developments made by the G-Connect project is about data security; most of the problems verification of the data sent. In previous studies, Keccak and RSA algorithms have implemented for data verification needs. But after a literature study of other algorithms that can make digital signatures, we found what is meant by an algorithm that is better than RSA in rectangular speeds, namely Digital Signature Algorithm (DSA).DSA is one of the key algorithms used for digital signatures, but because DSA still uses Secure Hash Algorithm (SHA-1) as an algorithm for hashes, DSA rarely used for data security purposes, so Keccak is used instead of the hash algorithm on DSA. Now, Keccak become the standard for the new SHA-3 hash function algorithm. Because of the above problems, the focus of this research is about data verification using Keccak and DSA. The results of the research are proven that Keccak can run on DSA work system, obtained a comparison of execution time process between DSA and RSA where both use Keccak.

scholarly journals Desain dan Implementasi Mekanisme Tanda Tangan Dijital Dalam Pertukaran Data Dengan Hash MD5 dan Enkripsi/Dekripsi Menggunakan Algoritma RSA

2018 ◽  
Author(s):  
Junaidy Budi Sanger
Keyword(s):  
Digital Signature ◽  
Information Exchange ◽  
Hash Function ◽  
Data Transfer ◽  
Data Integrity ◽  
Digital Signatures ◽  
Rsa Algorithm ◽  
The Difference ◽  
Privacy Problem ◽  
Problem Data

Information exchange in a network could lead into some problems, such as privacy problem, authentication problem, data integrity problem, and non-repudiation problem. Thus, precise security acts are needed to solve those problems. Digital signature is a solution to solve those problems. Digital signature is basically just like a written signature, which is used to authenticate documents. The difference is that the written signature usually describes the name of a signer whereas the digital signature consists of cryptography codes of a message and a sender. Digital signature using hash function is one of the most used digital signatures. Unfortunately, this kind of digital signature can not solve all given problems, such as privacy problem and non repudiation problem. Therefore, RSA algorithm is needed to solve that problem. The result of this research is the implementation of digital signature along with RSA algorithm and MD5 hash function in a data transfer application.

scholarly journals Analysis and research of digital signature algorithm Picnic

Radiotekhnika ◽  
2020 ◽  
pp. 19-24
Author(s):  
M.V. Yesina ◽  
B.S. Shahov
Keyword(s):  
Digital Signature ◽  
Hash Function ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Mathematical Methods ◽  
Digital Signature Algorithm ◽  
Algebraic Lattices ◽  
The Us ◽  
Source Data ◽  
The Stability

An important feature of the post-quantum period in cryptography is the significant uncertainty regarding the source data for cryptanalysis and counteraction in terms of the capabilities of quantum computers, their mathematical and software, as well as the application of quantum cryptanalysis to existing cryptotransformations and cryptoprotocols. Mathematical methods of digital signature (DS) have been chosen as the main methods of NIST USA, which have undergone significant analysis and substantiation in the process of extensive research by cryptographers and mathematicians at the highest level. They are described in detail and studied at the first stage of the US NIST International Competition. In the second round, a number of decisions were made to merge some candidates for the post-quantum DS standard. 9 candidates were left for further research at the 2nd round: Crystals-Dilithium, Falcon, GeMSS, LUOV, MQDSS, Picnic, qTESLA, Rainbow and SPHINCS+. Three of them (Dilithium, Falcon, qTeSLA) are based on the stability of algebraic lattices (Lattice-based), four (GeMSS, LUOV, MQDSS, Rainbow) are based on multivariate transformations (MQ-transformations), one (SPHINCS+) is based on the stability of hash-function, one (Picnic) is based on the stability of the hash-function and block stream ciphers. During the 2nd round of the US NIST Competition the following finalist algorithms and alternative algorithms were selected as digital signatures according to the results of research on promising post-quantum cryptographic algorithms. As finalists algorithms such DS algorithms as Crystals-Dilithium, Falcon and Rainbow. Alternative algorithms are GeMSS, Picnic and SPHINCS+ were selected. This paper studies the peculiarities of construction of the digital signature algorithm considered as a candidate for the promising post-quantum standard of the NIST PQC competition – Picnic, also it analyzes the protection of the algorithm from known attacks. Data from the comparison of post-quantum algorithms such as digital signature are given. The description of the Picnic algorithm and its parameters are given.

Sign in / Sign up

Export Citation Format

Share Document