Cipher Method Research Articles

A proposed encryption technique of different texts using circular link lists

A different texts encryption technique is presented in this paper. The sensitive information is encrypted in different manner via using circular link lists as data structure that contains different encryption algorithms such as: LU and LEE, Rabin, Okamoto-Uchiyama, McEliece and Paillier algorithms. Using circular link lists as data structure aims for making the information ciphering most secure. The main idea of using circular link lists is making each character of sensitive information will encrypt by different cipher method in each iteration of encryption process. The above encryption algorithms are scheduled in circular link lists and selected via execution process respectively. The sensitive information that used in this work are consist of English and Arabic texts. So, the special characters and symbols are considered. The merge text from different languages such as English and Arabic with its special characters and symbols is encrypted effectively. When a different text encryption technique is implemented, the experimental results illustrate the high level of security, the ability to cipher merge texts and efficiency. The security, integrity and complexity are satisfied in this work.

A new approach of classical Hill Cipher in public key cryptography

Secure message transformation promote the creation of various cryptography systems to enable re???ceivers to interpret the transformed information. In the present age of information technology, the secure transfer of information is the main study of most agencies. In this study, a particular symmetric cryptography system, Hill Cipher method, is enhanced with the help of encryption and decryption algorithms of the asymmetric RSA cryptography system to avoid certain problems. Previous results show that the original Hill algorithms are still insufficient because of their weakness to known plaintext attack, and a modification of the Hill Cipher cryptography system is therefore presented to increase its invulnerability. The enhancement focuses on implementing the RSA algorithms over the Hill Cipher to increase its security efficiency. The suggested method relies on the security of the RSA and Hill Cipher cryptosystems to find the private decryption keys, and thus is much more secure and powerful than both methods applied separately. Also secure and dynamic generation of the Hill Cipher matrix instead of using static matrix are proposed. This new approach is composed of a public key cryptosystem that has a shared secret key (between participants only), public key (announced to all), and two private keys (for each person). Therefore, this new modification can increase the invulnerability of the Hill Cipher against future attacks during transmission of information between agencies in this age of information technology

A new Modified method of Cryptography using Caesar Cipher

Nowadays the modern world depends on connections through the internet brings different teams together. The essential components of communication are sender, medium, and receiver. Data transmission over the internet is not possible without any encryption method due to security issues. Different types of areas like corporate sectors, banking sectors, government sectors, and many other sectors share their data through the internet. Hackers always try to attack the transmitted data and try to recover the data. Various techniques are developed for providing data security. Cryptography is used for the safe transmission of data. Encryption is done at the sender side in cryptography, and decryption is done at the receiver side. In the encryption technique, Caesar cipher is one of the best examples. The analysis of Basic Caesar cipher, Delta formation Caesar cipher, and XOR Caesar cipher is done based on many parameters like Avalanche Effect, Frequency Test, and Brute force attack. The authors of this paper have tried to modify the caesar cipher method, which produces ciphertext that can be read. After that with the new ciphertext that can be read, then cryptanalysis not suspicious of the ciphertext.

Combining caesar cipher and hill cipher in the generating encryption key on the vigenere cipher algorithm

There is a risk in the process of exchanging information, especially text information. To reduce that risk, one of cryptographic method can be applied. That is Vigenere Cipher algorithm. But the Vigenere Cipher algorithm have a weakness. The weakness is a repetitive encryption key. It causes the chipertext to be predictable with the Babbage-Kasiski method. By combining Caesar Cipher and Hill Cipher methods in the process of generating the encryption key, its expected to cover up the weakness of the Vigenere Cipher method. The combination has the capability to hide the character appearance’s frequencies.

A hierarchical secure data aggregation method using the dragonfly algorithm in wireless sensor networks

A wireless sensor network (WSN) consists of a set of sensor nodes that are widely scattered in inaccessible areas. When deployed in large areas, WSNs generate a large volume of the data. Therefore, efficient methods are needed to process the data. One solution to minimize traffic on large-scale wireless sensor networks is to use data aggregation schemes. In this paper, a secure data aggregation method is proposed. The proposed secure data aggregation scheme has three phases: intra-cluster data aggregation, inter-cluster data aggregation, and data transfer. In the intra-cluster data aggregation phase, a fuzzy scheduling system is designed to adjust the appropriate data transmission rates of the cluster member nodes. In the inter-cluster data aggregation phase, an aggregation tree is created between the cluster head nodes. The dragonfly algorithm (DA) is used to find the optimal aggregation tree between cluster head nodes. In the data transfer phase, the columnar transposition cipher method is used to establish a secure connection between cluster member nodes and their cluster head node. Also, a symmetric and lightweight encryption method based on the residue number system (RNS) is utilized to provide secure communications between the cluster head nodes. We modify RNS and call it RNS+. Finally, the simulation results of the proposed scheme are compared to three data aggregation methods including Sign-share, Sham-share, and RCDA. The results show that the proposed data aggregation scheme outperforms other data aggregation methods in terms of network lifetime, delay and packet delivery rate.

New Programmatic OTP Algorithm

The huge improvement in the field of data innovation and the web presentation to a surge of infringement to go around and take data, the earnest requirement for the development of information assurance advancements and information encryption procedures. A new Programmatic OTP Algorithm using an unsystematic key generation for ciphering plaintext presented in this paper. This method, based on create randomly a number (n) called add number, where the plaintext characters converted to a binary form and splits into equal parts according to n value with 2n ciphering keys generated. The keys will be distributed on these parts to get ciphered text. Accordingly, one of these keys its generation number will be set for all different n’s. The different n’s occurred Consecutively to the number of characters consist the plain message unlike the traditional OTP algorithm. This method characterized by a facility that the same generated key can produce different ciphering text using 2n probability. The proposed methodology has been proved as perfect ciphering method compared with OTP using statistical tests

Cryptanalysis Using DNA-Sticker Algorithm

Sticker model is one of the basic computer models of filtering model which is part of Non-Autonomous DNA computing models. This model inputs are represented by encoded one of a double (single - double) strand of DNA molecules, which is annealed with a short fraction of strings at some positions, and therefore these strands called memory complexes. Since its inception, DNA computing has provided a highly efficient and energy efficient technology for solving complete NP problems because of its really high data density and inherent parallels. In this paper, we explain how to use the sticker model, which is one of the types of molecular computations in DNA computing, to design an algorithm for coding analysis of the coded text in an unsystematic cipher method. The cipher text is broken by employing the idea of brute force attack, which works to represent all possible keys and then try it to break the encrypted text until reaching the correct key from among the total keys group representing by solution space. Theoretically, both the cipher text and all possible keys are represented using memory complexes of the DNA strands. Then, using sticker operations, as separation, combination, and proposed operation named length, we can remove the incorrect keys from the solution space of memory complexes, by taking advantage of the parallel processing of DNA computing, therefore this model is classified as filtering model.

Refined Imbricate Cryptography with addition of Polygram Substitution Cipher Method: an enhanced tool for security

The booming of technologies these days make us more comfortable and also take us into the complex world. As information increases rapidly, the level of security also matters. As a technological paradigm, the security can be done using many cryptography techniques. Cryptography is a process of converting a plain text into a cipher text so that the data can be viewed or extracted only by an intended user. In this paper, we describe a methodology inorder to enhance the speed of encryption and decryption process. This process uses ciphertext formation via Imbricate Cryptography and Polygram Substitution Cipher Technique. On performing cryptography, there are a lot of improvements in the actual implementation. Most importantly, the advantage of combining these two algorithms is to make data more secure from the exploiters and also making the computer to process faster.

Optical Chaos KEY generator for Cryptosystems

Chaotic structures are ideally appropriate for the construction of cryptographic schemes, because random numbers are an inseparable part of every encryption scheme as a safety mechanism. The optical chaotic circuit is an ultra-fast physical Random number generator, which is illustrated using the CW laser that generates optical signal at 193.1 THz and M-Z modulator that works on an interferometric principle. The circuit generates truly high random bit sequences at different higher bit rates of 320Gb/s and 640 Gb/s. These generated random bits have passed the NIST statistical tests and Diehard battery tests, indicating their randomness for different practical applications. Further, the random number generated by optical chaos circuit is used to secure the image data using RC4 ciphering method.

Novel Stream Ciphering Algorithm for Big Data Images Using Zeckendorf Representation

Big data is a term used for very large data sets. Digital equipment produces vast amounts of images every day; the need for image encryption is increasingly pronounced, for example, to safeguard the privacy of the patients’ medical imaging data in cloud disk. There is an obvious contradiction between the security and privacy and the widespread use of big data. Nowadays, the most important engine to provide confidentiality is encryption. However, block ciphering is not suitable for the huge data in a real‐time environment because of the strong correlation among pixels and high redundancy; stream ciphering is considered a lightweight solution for ciphering high‐definition images (i.e., high data volume). For a stream cipher, since the encryption algorithm is deterministic, the only thing you can do is to make the key “look random.” This article proves that the probability that the digit 1 appears in the midsection of a Zeckendorf representation is constant, which can be utilized to generate the pseudorandom numbers. Then, a novel stream cipher key generator (ZPKG) is proposed to encrypt high‐definition images that need transferring. The experimental results show that the proposed stream ciphering method, with the keystream of which satisfies Golomb’s randomness postulates, is faster than RC4 and LSFR with indistinguishable performance on hardware depletion, and the method is highly key sensitive and shows good resistance against noise attacks and statistical attacks.

Light Weight Cryptography Based Encrypted Multiple Secret Share Creation for Biometrics Images

Owing to the rapid growth of information technologies, a rising need for cybersecurity and biometric technologies is increasingly evolving. Biometrics image protection is an important problem as digital images and medical details are distributed via public networks. This research work proposed a threshold-based share creation scheme for Biometrics images. To enhance the security level of the shares, each shares are encrypted by Light Weight Cryptography (LWC)-Stream Cipher method. To increase the stream cipher encryption efficiency, optimal keys are selected by Ant Lion Optimization (ALO) technique. The benefit of consuming stream ciphers is that the speed of execution is maximum over block cipher and less complex. The benefit of the suggested stream cipher approach is that the decoding of the keys in the keystream and the characters in the plain text denotes decrypted biometrics image will improve device reliability. From the implementation results proposed model achieves the maximum PSNR with the security of Biometrics images, compared to other existing techniques.

Implementation of CAESAR CIPHER Cryptography Techniques for Android Based Information Data Security

Information data security is an important aspect of exchanging data and information. Data and information security can be done in various ways, including by using the cesarean cipher method in cryptographic techniques. The cesarean cipher method of cryptographic technique is a substitution coding system which is done by replacing each alphabet character with other characters along the 26 alphabet characters so that the coding only occurs in the alphabet itself without any other punctuation. This study proposes a modification to the cesarean cipher technique by adding to the number of characters used, namely 256 characters in the ASCII code. The caesar cipher application or CaesarApp uses the methodology of library study, consultation, application design and application testing. The implementation of the CaesarApp application was created using the open-source Android Studio 3.5 application. The results of tests conducted on the CaesarApp application note that the modification of the caesar cipher with 256 ASCII characters results in a secure information data security application, this application has a deficiency in reading limitations on ASCII characters, so characters cannot be read properly on android users.

An Encryption Method Based on “Zipper” Stochastic Dynamic Hashing

This paper studies the theoretical problems and implementation methods of stream ciphers, discusses some deficiencies of conventional stream cipher algorithms, designs methods and rules for random Dynamic Hash Mapping and Bits Scrambling, applies nonlinear feedback shift register (NLFSR) technology, and a new stream cipher method with higher security strength and suitable for encryption of short information is proposed. The purpose is to apply the proposed new method of stream cipher to obtain higher encryption strength and code uniformity, and make some theories and algorithms in the research results have beneficial effects on information security in the era of big data.

A Novel Privacy Approach of Digital Aerial Images Based on Mersenne Twister Method with DNA Genetic Encoding and Chaos

Aerial photography involves capturing images from aircraft and other flying objects, including Unmanned Aerial Vehicles (UAV). Aerial images are used in many fields and can contain sensitive information that requires secure processing. We proposed an innovative new cryptosystem for the processing of aerial images utilizing a chaos-based private key block cipher method so that the images are secure even on untrusted cloud servers. The proposed cryptosystem is based on a hybrid technique combining the Mersenne Twister (MT), Deoxyribonucleic Acid (DNA), and Chaotic Dynamical Rossler System (MT-DNA-Chaos) methods. The combination of MT with the four nucleotides and chaos sequencing creates an enhanced level of security for the proposed algorithm. The system is tested at three separate phases. The combined effects of the three levels improve the overall efficiency of the randomness of data. The proposed method is computationally agile, and offered more security than existing cryptosystems. To assess, this new system is examined against different statistical tests such as adjacent pixels correlation analysis, histogram consistency analyses and its variance, visual strength analysis, information randomness and uncertainty analysis, pixel inconsistency analysis, pixels similitude analyses, average difference, and maximum difference. These tests confirmed its validity for real-time communication purposes.

SISTEM STEGANOGRAPHY DENGAN METODE LEAST SIGNIFCANT BIT (LSB) & METODE CAESAR CIPHER BERBASIS ANDROID

This research aims at information security in the form of document files, documents are casual but have a vital role, due to many cyber crimes that try or commit data theft, illegal access or misuse of documents that are used as a particular crime tool. the software development method uses the Rapid Application Development (RAD) model, while the research method applies the Least Significant Bit (LSB) method of hiding information into a digital media (image) as a steganographic technique and Caesar Cipher as a cryptographic technique that encrypts * document filename into aform Caesar randomly characters. The results of the study resulted in an android-based steganography system that uses the Java programming language, as data security for document systems using the least significant bit and caesar cipher method as a top priority and making the system more friendly and interactive to be used easily by users. Steganography system is considered to provide an alternative for users as a system that is able to maintain the confidentiality of documents and provide information to users of the importance of a data security measure.

Perancangan Aplikasi Penyandian Pesan Teks dengan Menggunakan Algoritma Digraph Cipher

Humans interact with fellow humans using communication. Not everything that is communicated contains a message so that it can be known by many people, sometimes the communication is confidential so that only certain people can know it. The occurrence of data tapping submitted is certainly a problem if the data is confidential, therefore a data security system is needed so that the data cannot be stolen or changed by tappers or crackers. One solution to secure data is to use cryptography. Cryptography is the science and art of maintaining message security when messages are sent from one media to another without experiencing interference from third parties. Through cryptographic techniques, data can be changed into passwords that are not understood and return them back to the original, this process is called data encryption and decryption. This data security process uses the Digraph Cipher method. Some facilities in the Digraph Cipher method are the keys used in the encryption and decryption process are the same (symmetrical) and the decryption process is the opposite of the encryption process.

Design Of Hybrid Cryptography With Vigenere Cipher And RSA Algorithm On IOT Data Security

In this paper two methods are used, namely the vigenere cipher method and the RSA method. The vigenere cipher method is an example of a symmetric algorithm, while RSA is an example of an asymmetric algorithm. The combination of these two methods is called hybrid cryptography which has the advantage in terms of speed during the encryption process. Each process, which is encryption and decryption, is carried out twice, so that security can be ensured. In the process of forming the key used the RSA method. In the encryption process using public keys that have been generated before when the key is formed. This public key is used in sending data to the recipient of a secret message where this key is used for the data encryption process. The Secret key is kept and will be used during the decryption process. There is a system architecture that describes how clients and servers communicate with each other over the internet using the TCP protocol where the client here is an IoT device and the server is a server.

Creating Ciphertext and Decipher using Graph Labeling Techniques

In this paper, we design plaintext through product edge labeling for a Cyclegraph. The edge labels thus obtained is further processed through Caesar cipher method. The ciphertext thus obtained is subjected to Bifid Cipherfor which we apply matrix multiplication. The decryption is performed usingInverse matrix multiplication and subsequent application of Bifid cipher and Caesar Cipher yields our plaintext. This methodology is considered highly efficient and secure as it combines Cryptographic technique together with Graph Labeling thereby making it difficult for any Adversary to hack the plaintext. We investigate the above technique using Non- singular square matrices.

Modified Vegenere Cipher to Enhance Data Security Using Monoalphabetic Cipher

The rapid progression of exchange data by public networks is important, especially in information security. We need to keep our information safe from attackers or intruders. Furthermore, information security becomes needed for us. Many kind cipher methods of cryptography are improved to secure information such as monoalphabetic cipher and polyalphabetic cipher. Cryptography makes readable messages becoming non-readable messages. One of the popular algorithms of a polyalphabetic cipher is Vigenere cipher. Vigenere cipher has been used for a long time, but this algorithm has weaknesses. The calculation of the encryption process is only involving additive cipher, it makes this algorithm vulnerability to attacker based on frequency analysis of the letter. The proposed method of this research is making Vigenere cipher more complex by combining monoalphabetic cipher and Vigenere cipher. One of the monoalphabetic ciphers is Affine cipher. Affine cipher has two steps in the encryption process that are an additive cipher and a multiplicative cipher. Our proposed method has been simulated with Matlab. We also tested the vulnerability of the result of encryption by Vigenere Analyzer and Analysis Monoalphabetic Substitution. It shows that our method overcomes the weakness of Vigenere Cipher. Vigenere cipher and Affine cipher are classical cryptography that has a simple algorithm of cryptography. By combining Vigenere cipher and Affine cipher will make a new method that more complex algorithm.

Application Of Hill Cipher And LSB + 1 Methods For Messaging In Messages Inpicture

This research discusses encryption and security description of files in images with hill cipher cryptography and steganogography using the lsb + 1 method, testing the results of cryptographic and stegano data security applications that are equipped with cryptography, then from the results the trial was done with the hill cipher method, by displaying data in the form of files that want to do the data security. The results of the DIPA trial with a file size of 17.2 MB after being encrypted into RNPF with a file size of 17.2 MB.