Vernam Conjugated Manipulation of Bit-plane Complexity Segmentation

Siahaan, Andysah Putera Utama

doi:10.14257/ijsia.2017.11.9.01

Cited by 7 publications

(7 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Polybius put the letters in the column line array size of 5 × 5. The way this system works is that every letter is expressed as rows and columns in which the letters are placed [6][11] [12]. For example, the letter "A" is encoded with "1-1", "B" as "1-2", "C" as "1-3", "D" as "1-4", "E" as "1-5" and so on.…”

Section: Polybius Squarementioning

confidence: 99%

Rail-Fence-Cryptography-in-Securing-Information

Siahaan¹

2017

Preprint

Self Cite

View full text Add to dashboard Cite

Rail Fence Cipher is a further development method of Caesar Cipher. In Caesar algorithm, the results derived from the ciphertext letters shifting each character in the plaintext. While in the Rail Fence, it is taken from the ciphertext block formation matrix diagonally. The level of security in this method has advantages than in the previous method. In this study, the research tries to encrypt and decrypt the message using the Rail Fence algorithm. The ciphertext is obtained by taking a certain set of characters in the line that has been determined earlier.

show abstract

Section: Polybius Squarementioning

confidence: 99%

Rail-Fence-Cryptography-in-Securing-Information

Siahaan¹

2017

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Data security needs to be improved by checking similar documents [22]- [26] Document similarity measure is a technique for measuring the level of similarity of documents. It is always used in the academic world.…”

Section: Similaritymentioning

confidence: 99%

Combination of levenshtein distance and rabin-karp to improve the accuracy of document equivalence level

Siahaan¹,

Aryza²,

Hariyanto³

et al. 2018

IJET

View full text Add to dashboard Cite

Rabin Karp algorithm is a search algorithm that searches for a substring pattern in a text using hashing. It is beneficial for matching words with many patterns. One of the practical applications of Rabin Karp's algorithm is in the detection of plagiarism. Michael O. Rabin and Richard M. Karp invented the algorithm. This algorithm performs string search by using a hash function. A hash function is the values that are compared between two documents to determine the level of similarity of the document. Rabin-Karp algorithm is not very good for single pattern text search. This algorithm is perfect for multiple pattern search. The Levenshtein algorithm can be used to replace the hash calculation on the Rabin-Karp algorithm. The hash calculation on Rabin-Karp only counts the number of hashes that have the same value in both documents. Using the Levenshtein algorithm, the calculation of the hash distance in both documents will result in better accuracy.

show abstract

“…Steganography is a technique to hide personal information with something that results will look like other standard information [5]- [7]. Media used is generally a different medium with confidential information carrier media, where this is the function of steganography technique, which is a disguise technique using other media different so that confidential information in the first media is not visible [8].…”

Section: Theories: 21 Steganographymentioning

confidence: 99%

Technique of Hiding Information in Image using Least Significant Bit

Siahaan¹

2018

Preprint

Self Cite

View full text Add to dashboard Cite

Information hiding is very important because a lot of data theft occurs which can result in significant losses. Data security can be done by hiding information into a media. This media can be in the form of images or sounds. There are several concealment techniques in the picture. In this study, we will discuss the hiding of information in a 24-bit color image which consits of 3 x 8-bit. The method used is Least Significant Bit (LSB). This method is used to insert messages into the 24-bit color image insertion media on every 1 of the most significant bits of each image color. The layers used are Red, Green, and Blue. This method has a small MSE and does not appear to differ if the image is seen directly with the eye. The results of the research show that MSE calculation is not so much different from the original image. Peak Signal to Noise ratio (PSNR) for each image inserted with the maximum message size can produce an average value above 40 dB. This LSB method is excellent to use to provide information in the form of images.

show abstract

Vernam Conjugated Manipulation of Bit-plane Complexity Segmentation

Abstract: Abstract

Cited by 7 publications

References 8 publications

Rail-Fence-Cryptography-in-Securing-Information

Rail-Fence-Cryptography-in-Securing-Information

Combination of levenshtein distance and rabin-karp to improve the accuracy of document equivalence level

Technique of Hiding Information in Image using Least Significant Bit

Contact Info

Product

Resources

About