scholarly journals Increasing Complexity of Cryptographic Using Combination of Hill Cipher and Cipher Block Chaining

2020 ◽  
Vol 4 (2) ◽  
pp. 92-97
Author(s):  
Abd Charis Fauzan ◽  
Veradella Yuelisa Mafula

Security and confidentiality of documents stored on a computer is an important aspect in the field of computer or information system security. Documents will no longer be useful if they are intercepted or hijacked by unauthorized people, they will even endanger the document owner, if documents containing important information are misused by irresponsible people. Therefore the documents on the computer must be preserved so that they are only accepted and used by interested persons. One of the solutions to prevent eavesdropping of documents is to use cryptography. This study aims to increase cryptographic complexity using a combination of hill cipher algorithms and block chaining cipher modes. The combination of the two methods is expected to be able to cover the shortcomings of each method so that the cryptographic complexity can be increased. The method in this study consists of two stages, namely the document encryption and document decryption stages. The encryption stage is to change the plaintext document into a ciphertext document, on the other hand, the decryption stage is to change the ciphertext document back into a plaintext document. The stages for document encryption include; 1) retrieve plain text messages in the document so that they can be processed by the system (parsing); 2) encryption to convert plaintext documents into ciphertext documents using the hill cipher algorithm; 3) encryption to convert plaintext documents into cipher text documents using cipher block chaining mode. While the methods for decryption are 1) taking the ciphertext message in the document so that it can be processed by the system (parsing); 2) decryption to convert ciphertext documents into plaintext documents using cipher block chaining mode; 3) decryption to convert ciphertext documents into plaintext documents using a hill cipher.

2017 ◽  
Vol 1 (1) ◽  
Author(s):  
Sherly Gina Supratman

AbstrakJaringan Komunikasi seperti Internet� merupakan jaringan yang tidak aman untuk mentransmisi data, seperti teks, audio,video dan citra digital. Salah satu cara untuk pengamanan data dapat dilakukan dengan menggunakan proses kriptografi dan �steganografi. Penggunaan ini dengan tujuan untuk merahasiakan pesan yang dikirim dan sekaligus menghindarkan pesan tersebut dari kecurigaan pihak lain yang tidak berkepentingan.Pesan yang digunakan dalam makalah ini adalah berupa text dengan menyisipkannya pada gambar. Pada proses kriptografi, pesan yang berupa text akan dienkrip dengan algoritma Hill Chiper, dan kemudian pesan yang telah dienkrip akan dilakukan proses steganografi pada citra digital� 8 bit dengan skala 0 � 255, dengan metode Least Significant Bit ( LSB ).�Kata kunci: Kriptografi, Hill Chiper, Steganografi, Least Significant Bit�AbstractCommunication Networks such as the Internet are unsafe networks for transmitting data, such as text, audio, video and digital imagery. One way to secure data can be done by using cryptography and steganography process. This use is for the purpose of concealing messages being transmitted and avoiding such messages from the suspicion by others who are not interested.The message used in this paper is text by inserting it in the image. In the cryptographic process, text messages will be encrypted with the Hill Chiper algorithm, and then the encrypted message will be steganographed on 8-bit digital images on a scale of 0-255, using the Least Significant Bit (LSB) method.�Keywords: Cryptography, Hill Chiper, Steganography, Least Significant Bit


2018 ◽  
Author(s):  
Andysah Putera Utama Siahaan

Computer security aims to help users prevent fraud or detect fraud in an information-based system. The information must be secured to be free from threats. Cryptographic techniques can prevent data theft. One cryptographic algorithm is Hill Cipher. This algorithm is one symmetric cryptography algorithm. The Hill Cipher algorithm uses an m x m sized matrix as the key to encryption and decryption. The fundamental matrix theory used in Hill Cipher is multiplication between matrices and inverses the matrix. Hill Cipher has two types of matrices in general, 2 x 2 and 3 x 3. This study discusses the order 2 x 2. The application of Hill Cipher in text-shaped media is highly recommended because it has fast encryption and decryption speeds. This method is very good at securing data that will be transmitted on an open network.


2013 ◽  
Vol 6 (3) ◽  
pp. 97-106
Author(s):  
Mohammed Sami Mohammed

Two techniques combined with each other, to get complex one. One from technique of genetic algorithm (GA) and the other is PlayFair cipher method, in this research using one step of Genetic Algorithm (GA) which called Crossover to make offspring of two parents (characters) to get one or two new character by using these techniques then using PlayFair technique to cipher text (plain text). So the person who wants to break code, two techniques must know.This research is a novel method of ciphering by getting a new generation of offspring from two characters, when we give a new theory of symbols as mention in research.


2021 ◽  
Vol 6 (1) ◽  
pp. 41
Author(s):  
Endaryono Endaryono ◽  
Nurfidah Dwitiyanti ◽  
Heri Satria Setiawan

<p><em>One of several algorithms in cryptography is the Hill Cpher method. This method is used in randomizing the contents of the message using a password key in the form of a matrix with the order MXM. The product in this research is a simulation design to explain how a plaintext message is converted into cipher text with encryption and decryption processes and vice versa from ciphertext to paintext through multiplication and inverse matrix operations. using Microsoft Excel (MS Excel). In this study, a matrix with order 2x2 and modulo 26 was used. This simulation design shows how the work process visually for each step in the process of changing the message content in the Hill Cipher method. It is hoped that the results of this study can be used as a learning medium by the community, especially students and lecturers, to increase understanding and broaden their horizons about the Hill Cipher method in cryptography lectures.</em><em></em></p>


2020 ◽  
Vol 4 (3) ◽  
pp. 1
Author(s):  
Desimeri Laoli ◽  
Bosker Sinaga ◽  
Anita Sindar R M Sinaga

Nowadays people exchange information in digital media such as text, audio, video and imagery. The development of Information and Communication makes the delivery of information and data more efficient. Current developments in technology which are very significant have an impact on the community in exchanging information and communicating. Confidential hidden data can also be in the form of image, audio, text, or video. The Hill Chiper algorithm uses a matrix of size m x m as a key for encryption and decryption. One way to recover the original text is of course to guess the decryption key, so the process of guessing the decryption key must be difficult. break ciphertext into palintext without knowing which key to use. The LSB part that is converted to the value of the message to be inserted. After affixing a secret message, each pixel is rebuilt into a whole image that resembles the original image media. The Hill Cipher algorithm is used to determine the position of the plaintext encryption into a random ciphertext. 2. Testing text messages using the hill cipher algorithm successfully carried out in accordance with the flow or the steps so as to produce a ciphertext in the form of randomization of the letters of the alphabet.   


Author(s):  
Ravinder Paspula ◽  
K. Chiranjeevi ◽  
S. Laxman Kumar

A new-promising technology called DNA-Cryptography is emerged in the area of DNA- Computing field.DNA useful for store, sending the data and also to perform computation. Even it is under primal level, DNA-Based molecular Cryptography system is shows extremely efficient. This technique offers a unique cipher-text generation process and a new key generation practice. This method used to implement a procedure which includes two stages. First stage generates a session key and encryption key and it uses cipher block chaining mode-CBC, the secrete number(s) and incorporate plain-text M into level-1 cipher-text. The last stage converts the level-1 cipher-text into level-2 cipher-text (s). The level-2 cipher-text is again transformed into human made DNA-sequence (S’) and is given to the receiver along with many other DNA-sequence. By this process it will become a more complicated for un-authorized user to gain original information. The receiver will apply the process to identify the human made DNA sequence with M hidden in it and extract the original message M.


Author(s):  
Laith Mohammad Abualigah ◽  
Essam Said Hanandeh ◽  
Ahamad Tajudin Khader ◽  
Mohammed Abdallh Otair ◽  
Shishir Kumar Shandilya

Background: Considering the increasing volume of text document information on Internet pages, dealing with such a tremendous amount of knowledge becomes totally complex due to its large size. Text clustering is a common optimization problem used to manage a large amount of text information into a subset of comparable and coherent clusters. Aims: This paper presents a novel local clustering technique, namely, β-hill climbing, to solve the problem of the text document clustering through modeling the β-hill climbing technique for partitioning the similar documents into the same cluster. Methods: The β parameter is the primary innovation in β-hill climbing technique. It has been introduced in order to perform a balance between local and global search. Local search methods are successfully applied to solve the problem of the text document clustering such as; k-medoid and kmean techniques. Results: Experiments were conducted on eight benchmark standard text datasets with different characteristics taken from the Laboratory of Computational Intelligence (LABIC). The results proved that the proposed β-hill climbing achieved better results in comparison with the original hill climbing technique in solving the text clustering problem. Conclusion: The performance of the text clustering is useful by adding the β operator to the hill climbing.


Author(s):  
Priya Mathur ◽  
Amit Kumar Gupta ◽  
Prateek Vashishtha

Cloud computing is an emerging technique by which anyone can access the applications as utilities over the internet. Cloud computing is the technology which comprises of all the characteristics of the technologies like distributed computing, grid computing, and ubiquitous computing. Cloud computing allows everyone to create, to configure as well as to customize the business applications online. Cryptography is the technique which is use to convert the plain text into cipher text using various encryption techniques. The art and science used to introduce the secrecy in the information security in order to secure the messages is defined as cryptography. In this paper we are going to review few latest Cryptographic algorithms which are used to enhance the security of the data on the cloud servers. We are comparing Short Range Natural Number Modified RSA (SRNN), Elliptic Curve Cryptography Algorithm, Client Side Encryption Technique and Hybrid Encryption Technique to secure the data in cloud.


2021 ◽  
pp. 096834452199586
Author(s):  
James Shelley

Despite the vast academic and popular interest in the Dieppe raid of 19 August 1942, there remains a curious oversight of the German side of the story. This contribution interrogates German sources in order to explore the Dieppe air battle and its consequences from the perspective of the German armed forces. The paper ultimately demonstrates that the Germans learnt much about the role of air power in coastal defence from their experiences at Dieppe, but that the implementation of those lessons was lacking.


1897 ◽  
Vol 17 ◽  
pp. 319-320 ◽  
Author(s):  
Frank Calvert

I derive the materials of the present paper from some memoranda which I find amongst my archaeological notes and which relate to certain explorations to which I was not a party, made so long ago as 1887. I have thought that the particulars then obtained may be deemed sufficiently interesting to deserve a record in the history of Trojan archaeological discovery.The subject is one of the four small tumuli dotted about and near the hill of Balli-Dagh, the crest of which according to the now exploded theory of Le Chevalier (1785) was supposed to represent the Pergamos of Troy. In a memoir contributed to the Journal of the Archaeological Institute of 1864, I proved that the site in question was no other than that of the ancient city of Gergis. In the same paper I gave an account of the results of the excavation of one of the group of three tumuli on Balli-Dagh, the so-named Tomb of Priam. The other two, namely Le Chevalier's Tomb of Hector, and an unnamed hillock, were excavated respectively by Sir John Lubbock (about 1878) and Dr. Schliemann (1882) without result. The present relates to the fourth mound on the road between the villages of Bournarbashi and Arablar (as shown in the published maps), which goes by the name of Choban Tepeh (Shepherd's hillock) and the Tomb of Paris, according to Rancklin (1799).


Sign in / Sign up

Export Citation Format

Share Document