Mary Grace Ostia, Alessa Crisostomo, Dirk Lucas et al. · International Journal of Computing Sciences Research · 2024
Purpose–Enhance the Two-Square Cipher's effectiveness by developinganalgorithmto address vulnerabilities in plaintext variations, character set limitations and encryption performance. Method –Proposedadjustmentsincludeexpandingthegridto14x14,usingtableshuffling instead of random character insertion, and strategically inserting random special characters in odd-length plaintexts. Results –The algorithm demonstrated improved encryption, producing more random ciphertext sequences and successfully recovering original characters during decryption. Conclusion –The developed algorithm outperforms the current Two-Square Cipher, enhancing encryption security and adaptability to different plaintexts. Recommendations –Further enhance the algorithm to address specific issues such as character transformation, while maintaining the grid size at 14x14. Research Implications –Contributes to advancing cryptographic techniques, highlighting the importance of addressing vulnerabilities in existing ciphers to strengthen data security. Keywords –two-square cipher, columnar transposition, text encryption, cryptography, block and stream cipher
Cited by 0Open access
Dian Rachmawati, Mohammad Andri Budiman, Fadhilah Atika · Journal of Physics Conference Series · 2018
Data security is becoming one of the most significant challenges in the digital world. Retrieval of data by unauthorized parties will result in harm to the owner of the data. PDF data are also susceptible to data security disorder. These things affect the security of the information. To solve the security problem, it needs a method to maintain the protection of the data, such as cryptography. In cryptography, several algorithms can encode data, one of them is Two Square Cipher algorithm which is a symmetric algorithm. At this research, Two Square Cipher algorithm has already developed into a 16 x 16 key aims to enter the various plaintexts. However, for more enhancement security it will be combined with the VMPC algorithm which is a symmetric algorithm. The combination of the two algorithms is called with the super-encryption. At this point, the data already can be stored on a mobile phone allowing users to secure data flexibly and can be accessed anywhere. The application of PDF document security on this research built by Android-platform. At this study will also calculate the complexity of algorithms and process time. Based on the test results the complexity of the algorithm is θ (n) for Two Square Cipher and θ (n) for VMPC algorithm, so the complexity of the super-encryption is also θ (n). VMPC algorithm processing time results quicker than on Two Square Cipher. And the processing time is directly proportional to the length of the plaintext and passwords.
Cited by 2Open access
Saja Mohammed Suhael, Zaynab Ahmed, Abir Jaafer Hussain · Baghdad Science Journal · 2023
Cipher security is becoming an important step when transmitting important information through networks. The algorithms of cryptography play major roles in providing security and avoiding hacker attacks. In this work two hybrid cryptosystems have been proposed, that combine a modification of the symmetric cryptosystem Playfair cipher called the modified Playfair cipher and two modifications of the asymmetric cryptosystem RSA called the square of RSA technique and the square RSA with Chinese remainder theorem technique. The proposed hybrid cryptosystems have two layers of encryption and decryption. In the first layer the plaintext is encrypted using modified Playfair to get the cipher text, this cipher text will be encrypted using squared RSA to get the final cipher text. This algorithm achieved higher security to data but suffers from a long computational time. So Chinese remainder theorem has been used in the second hybrid cryptosystem to obtain less encryption and decryption time. The simulation results indicated that using the modified Playfair with the proposed square RSA has improved security. Moreover, using the Chinese remainder theorem achieved less encryption and decryption time in comparison to our first proposed and the standard algorithms.
Cited by 4Open access
Jorge Nakahara Jr, Jorge Nakahara, Joos Vandewalle et al. · 2002
This report surveys on a series of Square attacks on reducedround versions of the Skipjack block cipher. Skipjack is an iterated block cipher encrypting 64-bit plaintext blocks into 64-bit ciphertext blocks, using an 80-bit key. Its design is based on a generalized Feistel Network making up 32 rounds of two dierent types. This cipher was developed by the National Security Agency for the Clipper chip and Fortezza PC card. 1
Cited by 0
Sk. Myrunnisa Begum (pg Scholar · 2015
Abstract:-Thispaper introduces modified cryptographic technique, which uses two keys for encryption and same two keys are used for Decryption. This technique is generated by an intermediate cipher followed by genetic function singlepoint crossover to produce final cipher. This paper uses 5x5 squarematrix and the input data stream is put into the square matrix. Sum of the left diagonal positional values will be key 1 and with that key1 intermediate cipher text will be produced. Key 1 is variable and its value depends on the plain text.Single point crossover, is applied on the binary field of intermediate cipher text. Thefivedigit randomnumber will generate as key 2, and this key 2 is randomly generated, and fixed by the user before doing the crossover.According to the digits of key 2 block division process and crossover point is finalized to produce final cipher. Reverse procedure with the same keys
Cited by 0
Putri Nisa Pratiwi, Sisilia Sylviani · Mathematical Sciences and Applications Journal · 2023
The concept of cryptography is widely used to reduce data security threats along with developments in information technology. Affine Cipher is an example of classic cryptography that utilizes modular operations and shifts on characters. On the other hand, Hill Cipher method is more dependent on matrix operations. The combination of the two methods, Affine-Hill Cipher, creates a more complex and superior method in terms of security. In this research, we utilize a square skew-symmetric matrix with an order corresponds to the secret key to construct the key matrix. The encryption and decryption processes are carried out using the Affine-Hill Cipher and adding the key exchange concept into the algorithm. The results indicate that this algorithm’s complexity can effectively reduce data security threats.
Cited by 0Open access
Suriyani Ariffin, Nurul Aini Mohd Hisan, Shahrizal Arshad et al. · 2016
The antigen-antibody interaction, somatic hyper mutation and protein structural features in immune systems have been selected as inspired approach in designing the new block cipher algorithm called 3D-AES. However, these computation elements from immune systems have not proved yet whether it can be successfully applied and satisfies with Shannon's diffusion property in designing a new block cipher algorithm. This paper introduces two different types of attacks on the proposed block cipher. This paper measures and analyses the diffusion property of the block cipher by square attack and boomerang attack. It also discussed the best possible diffusion and described how it is relevant for chosen plaintext attack and conventional non related-key attacks based on the experiment done in the contact of the wide trail strategy family.
Cited by 4
Rama Prameswara Ritonga, Muhammad Zarlis, Erna Budhiarti Nababan · 2020
Affine Cipher is the development of Classic Caesar cipher that multiplies plain text before shifting operation. Affine cipher has two parameters namely key a, and b. Key ‘a’ is multiplies the plain text. It must have an inverse with Great Common Divisor (GCD) from the number of characters. The Problems of Affine Cipher Algorithm is the number of characters available and the least possible of key ‘a’ that can be used, so it is considered to be a classic technique that is easy to hack. Generally, Affine Cipher is used to encrypt the plaintext of character ‘A to Z’ so that the number of keys ‘a’ is only 12 digits from 26 digits (n) is available. Development of affine had increased the key ‘a’ into 128 of 256 digits (n) with 8 bit of ASCII. Digraph Transform is the modification of text encryption. It able to square the value of n. Usually, Text is encrypted by one character. In Digraph Transform, text is encrypted by two characters. For two characters, multiplying integer of the first character by number of characters, then add integer of the second character.
Cited by 3
Jan Carlo T. Arroyo · International Journal of Advanced Trends in Computer Science and Engineering · 2020
Cryptography is a technique that deals with securing data and is closely affiliated with information theory, computer security, and engineering. However, with the presence of adversaries that uses powerful computers, the need to increase the complexity of cryptographic techniques arises. This paper employed and hybridized the two commonly used ciphers in the literature, namely the Polybius square and the Caesar cipher, to ensure more secure data. To increase the strength of the hybrid cipher, the ciphertext generated by the Polybius square is XORed. Simulation results revealed that the proposed method generates a unique ciphertext that shows no trace of any pattern from the plain text, thus, devoid of being attacked by frequency analysis or by brute force.
Cited by 2Open access
Ikhsan Abdul Ro'uf, Mukhammad Solikhin, Lita Wulandari Aeli et al. · Jurnal Kajian Matematika dan Aplikasinya (JKMA) · 2023
Cryptography is a method for securing data or information from data leaks. In cryptography, there are two important processes, namely, the encryption and decryption processes. Encryption is the process of changing plaintext into ciphertext using certain keys and algorithms, while decryption is the process of changing ciphertext into plaintext using keys and algorithms that match the encryption. There is a cryptosystem that is well known, namely Cipher Hill. Cipher Hill uses a square matrix for the encryption and decryption process. In this research, an mxn-sized matrix will be used over the Direct Sum ring Z_p⨁Z_q⨁Z_r to expand the Cipher Hill algorithm. The author also uses the pseudoinverse concept to find the inverse of an mxn matrix. By using an mxn matrix, the encryption results allow the length of the plaintext to be different from the length of the ciphertext.Keywords: Cipher Hill, Cryptography, Decryption, Encryption, Direct Sum, Pseudoinvers
Cited by 0Open access
Mesran Mesran, Andysah Putera Utama Siahaan · OSF Preprints (OSF Preprints) · 2018
Data is the essential thing in the world of communication. Text messaging is a way of communicating that is sent in digital form. This message is very widely used in electronic media such as short message service. This message was sent through the service provider. Messages sent are unsafe and can be intercepted at the time of submission. Message delivery needs to apply cryptographic algorithms to text messages sent using encryption and decryption techniques. Super Playfair cipher and two square cipher algorithms are a development of Playfair cipher method. This method is a quite complicated way of solving it than other classical methods. These methods belong to classical cryptographic algorithms that use substitution encoding techniques and character transitions that use a symmetric key in the process of encryption and decryption.
Cited by 0
Andysah Putera Utama Siahaan, Mesran Mesran · 2018
Data is the essential thing in the world of communication. Text messaging is a way of communicating that is sent in digital form. This message is very widely used in electronic media such as short message service. This message was sent through the service provider. Messages sent are unsafe and can be intercepted at the time of submission. Message delivery needs to apply cryptographic algorithms to text messages sent using encryption and decryption techniques. Super Playfair cipher and two square cipher algorithms are a development of Playfair cipher method. This method is a quite complicated way of solving it than other classical methods. These methods belong to classical cryptographic algorithms that use substitution encoding techniques and character transitions that use a symmetric key in the process of encryption and decryption.
Cited by 4
International journal of intelligent engineering and systems · 2024
This paper proposes a transposition cipher algorithm based on cascaded spin shuffle (CSS).The plaintext is shuffled on a two-dimensional grid using CSS, where the letters are arranged based on spin motion, creating diverse permutations.The cascading technique prevents dead-ends at the grid's edge cells by wrapping around to the opposite side, resulting in complex permutations and allowing flexible placement of the initial spinning point.Unlike traditional transposition ciphers, such as columnar, route, and rail fence, which suffer from fixed-period repetition, the CSS technique avoids such limitations using the spinning and cascading mechanisms.Compared to the Advanced ciphers' Permutation Box (P-Box), which suffers from predictability with frequent patterns, key management, and high computation requirements, CSS offers a novel approach with unpredictable, arbitrary distribution and a variable-length key that enhances key space and simplifies implementation.The results of the proposed cipher using randomly generated files and keys showed that the proposed cipher maintains low correlation, Pearson, Spearman, Chi-Square, and Kolmogorov-Smirnov values.Compared to the existing ciphers, the proposed cipher implements a single round, thus reducing the time requirements.In terms of security, the proposed CSS algorithm defeats the n-gram statistical analysis and the simple cipher guessing.The proposed cipher was also analyzed for plaintext and key sensitivity.The performance analysis indicates its robustness and effectiveness.
Cited by 3Open access
Gandharba Swain, Saroj Kumar Lenka · 2011
In this paper we are proposing a technique for secret communication between Alice and Bob. We are using both cryptography and steganography. Firstly, we encrypt the secret message using our new cipher algorithm called twelve square substitution cipher algorithm, and then embed the cipher text in the carrier image in 6 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">th</sup> and 7 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">th</sup> bit locations or 7 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">th</sup> and 8 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">th</sup> bit locations or 6 and 8 bit locations of the different pixels (bytes) of the carrier image depending on the value of an index variable. Here the 8 bit means the least significant bit (LSB) location, the 7 bit means the LSB minus one location and the 6 bit means the LSB minus two location. The index variable value can be 0 or 1 or 2. The index variable value will change from 0 to 1 or 1 to 2 or 2 to 0 after each embedding. The initial value of the index variable depends upon the length of the cipher text. After embedding the resultant image should be sent to the receiver and receiver should retrieve the cipher text from the said locations and then decrypt by using the twelve square cipher algorithm to get the secret message. The embedding locations are not same in all pixels, so it is a stronger approach. The algorithm is implemented using Java programming language. The experimental results says that the algorithm performs well.
Cited by 16
Mustafa M. Abd Zaid, Ahmed Ali Talib Al-Khazaali, Ahmed Abed Mohammed · Springer Link (Chiba Institute of Technology) · 2024
\nCryptography and Steganography are two main components of information security. Utilizing encryption and Steganography to establish many layers of protection is a commendable approach. Our main objective of this paper is to build an integrated method of securely transmitting data through a combination of cryptography and Steganography. Cryptography and Steganography are two common methods of secretly transmitting information. RC4 is used in this paper to change information from plaintext to cipher, and then cipher text is integrated into the image by Least Significant Bit (LSB). The results are defined in terms of the processing time, the peak signal-to-noise ratio (PSNR), and mean square error (MSE). The experimental results showed the stego image’s acceptable quality and combining the two techniques provides additional security in the original Steganography.\n
Cited by 0Open access
Mustafa M. Abd Zaid, Ahmed Ali Talib Al-Khazaali, Ahmed Abed Mohammed · BIO Web of Conferences · 2024
Cryptography and Steganography are two main components of information security. Utilizing encryption and Steganography to establish many layers of protection is a commendable approach. Our main objective of this paper is to build an integrated method of securely transmitting data through a combination of cryptography and Steganography. Cryptography and Steganography are two common methods of secretly transmitting information. RC4 is used in this paper to change information from plaintext to cipher, and then cipher text is integrated into the image by Least Significant Bit (LSB). The results are defined in terms of the processing time, the peak signal-to-noise ratio (PSNR), and mean square error (MSE). The experimental results showed the stego image’s acceptable quality and combining the two techniques provides additional security in the original Steganography.
Cited by 2Open access
Mariusz Dzwonkowski, Roman Rykaczewski · Journal of Telecommunications and Information Technology · 2015
In this paper Quaternion Feistel Cipher (QFC) with an infinite key space based on quaternion Julia sets is proposed. The basic structure of the algorithm is based on the scheme proposed in 2012 by Sastry and Kumar. The proposed algorithm uses special properties of quaternions to perform rotations of data sequences in 3D space for each of the cipher rounds. It also uses Julia sets to form an infinite key space. The plaintext is divided into two square matrices of equal size and written using Lipschitz quaternions. A modular arithmetic was implemented for operations with quaternions. A computer-based analysis has been carried out and obtained results are shown at the end of this paper.
Cited by 2Open access
Abraham Itzhak Weinberg · ICCK Transactions on Information Security and Cryptography · 2025
This paper presents the Singularity Cipher, a novel cryptographic-steganographic framework that integrates topological transformations and visual paradoxes to achieve multidimensional security. Inspired by the non-orientable properties of the Klein bottle—constructed from two Möbius strips—the cipher applies symbolic twist functions to simulate topological traversal, producing high confusion and diffusion in the ciphertext. The resulting binary data is then encoded using perceptual illusions, such as the missing square paradox, to visually obscure the presence of encrypted content. Unlike conventional ciphers that rely solely on algebraic complexity, the Singularity Cipher introduces a dual-layer approach: symbolic encryption rooted in topology and visual steganography designed for human cognitive ambiguity. This combination enhances both cryptographic strength and detection resistance, making it well-suited for secure communication, watermarking, and plausible deniability in adversarial environments. The paper formalizes the architecture, provides encryption and decryption algorithms, evaluates security properties, and compares the method against classical, post-quantum, and steganographic approaches. Potential applications and future research directions are also discussed.
Cited by 0Open access
Hüseyin Demirci · Marmara University Open Access System · 2004
BLOK ŞİFRELEME ALGORİTMALARININ STOKASTİK METOTLAR YARDIMI İLE ANALİZİ\n\nBu çalışmada blok şifreleme algoritmalarının analizi üzerinde durulmuştur. İki özel algoritma üzerinde çalıştık. Rijndael, ABD'nin yeni standart şifreleme algoritmasıdır. IDEA ise Markov şifresi kavramının ilk olarak geliştirildiği algoritmadır. Her iki algoritma da yaygın olarak kullanılmaktadır. \nHer bir algoritmanın özel yapılarını kullanarak bu algoritmaların bazı yeni özelliklerini ortaya çıkardık. Şifreleme algoritmalarının çıktılarını rastgele bir permütasyondan ayırt etmek ve yapılan saldırıların karmaşıklığını hesaplamak için temel olasılık ve istatistik yöntemlerini kullandık. \nRijndael blok şifreleme algoritması için yarım kare özelliği bulunmuştur. Algoritmanın küçültülmüş hallerinde gözlenen ama gerçek algoritmada bulunmayan bazı özellikler ifade edilmiştir. Rijndael algoritmasına iki basamaktan oluşan bir eleme saldırısı geliştirilmiştir. Atağın birinci bölümünde bir değişkenin alabileceği tüm olası dizilimlerden oluşan bir küme çıkarılır. İkinci bölümde bu kümedeki dizilimlerden hiçbirini sağlamayan anahtar adayları elenir. \nIDEA blok şifreleme algoritması için, algoritmanın kelime tabanlı yapısının bir sonucu olan bazı değişkenlerin dağılımı ile ilgili özellikler sunulmuştur. Daha sonra bu özellikleri kullanarak iki tane kare-benzeri saldırı algoritması geliştirilmiştir. Bu özellikler IDEA algoritmasının çıktısını çok az sayıda seçilen mesaj kullanarak rastgele bir permütasyondan ayırdedebilmesi bakımından değerlidir. Bu özellikler daha da geliştirilerek, eleme saldırısı IDEA algoritmasına da uygulanmıştır. \n\n\nMayıs, 2004 \t\t\t \t\t Hüseyin Demirci\nABSTRACT\nANALYSIS OF BLOCK CIPHERS USING STOCHASTIC METHODS \n\nIn this study we have focused on cryptanalysis of block ciphers. We worked on two specific algorithms. Rijndael is the new standard encryption algorithm of USA, and IDEA is the block cipher where the concept of a Markov cipher has been developed. Both algorithms are being widely used. \nWe have investigated new properties of these ciphers by exploiting the specific structure of each algorithm. We have used basic probability and statistics methods to distinguish the ciphers output from a random permutation and to evaluate the complexity of the developed attacks. \nFor the Rijndael block cipher we have described the half square property. We have presented some square properties of mini versions of the cipher which can not be observed in the real version. We have also applied an elimination attack on Rijndael consisting of two steps. In the first part, we construct a set for the possible sequences of a variable. In the second part, we eliminate the key candidates from the lower part of the cipher which do not produce any of the elements of the previously calculated possible sequence set. \nFor the IDEA block cipher we have presented properties related with the distribution of some variables as a result of the word structure. Then, we have developed two square-like attacks using these properties. These properties are strong in the sense that they provide to distinguish IDEA block cipher output from a random permutation with very few chosen plaintexts. The properties are further developed and the elimination attack has also been applied on IDEA. \n\n\n May, 2004 \t\t\t\t\t\t\t Hüseyin Demirci
Cited by 0Open access
Md. Ismail Jabiullah, Md Zakaria Sarker, Anisur Rahman et al. · Daffodil International University Journal of Science and Technology · 1970
Secured message transactions are very much desirable for electronic communications in so many ways. A secured message transaction technique has been designed, developed and implemented using Java programming language. For this, a symmetric key encryption technique dynamic Hill cipher has been used for message encryption-decryption with a dynamic key length. A square-matrix of the given key length has been generated with the property that modulo operation of the product of the matrix and the inverse of that matrix is identity. The intended message is converted into binary form. Performs the bitwise-XOR operation of the equal two halves of the binary form and repeats the operations 3 times to generate the message digest (MD), and concatenate it with the message. Encrypts them using the Hill cipher technique with the key matrix and then send them to the destination. In the receiving end, the reverse process is performed to retrieve the message in secured manner. This process can be applied in many cryptographic applications as well as research works. Key Words: Security, Message Security, Message Digest, Hill Cipher and Cipher. DOI: 10.3329/diujst.v5i1.4383 Daffodil International University Journal of Science and Technology Vol.5(1) 2010 pp.62-66
Cited by 0Open access