262 research outputs found
Breaking the Hutton 2 challenge
In 2018, Eric Bond Hutton posed a challenge online involving a classical cipher of his creation. It was broken nearly two years later by brute-forcing the keywords, and a new challenge that involves a modified cipher was posted. This is an explanation of how we broke the second challenge. We did so by scanning all books on Project Gutenberg for an acceptable match, then resolving any discrepancies and finding the keys
A Modified Vigenère Cipher based on Time and Biometrics features
Biometrics is widely used with security systems nowadays; each biometric modality can be useful and has distinctive properties that provide uniqueness and ambiguity for security systems especially in communication and network technologies. This paper is about using biometric features of fingerprint, which is called (minutiae) to cipher a text message and ensure safe arrival of data at receiver end. The classical cryptosystems (Caesar, Vigenère, etc.) became obsolete methods for encryption because of the high-performance machines which focusing on repetition of the key in their attacks to break the cipher. Several Researchers of cryptography give efforts to modify and develop Vigenère cipher by enhancing its weaknesses. The proposed method uses local feature of fingerprint represented by minutiae positions to overcome the problem of repeated key to perform encryption and decryption of a text message, where, the message will be ciphered by a modified Vigenère method. Unlike the old usual method, the key constructed from fingerprint minutiae depend on instantaneous date and time of ciphertext generation. The Vigenère table consist of 95 elements: case sensitive letters, numbers, symbols and punctuation.  The simulation results (with MATLAB 2021b) show that the original message cannot be reconstructed without the presence of the key which is a function of the date and time of generation. Where 720 different keys can be generated per day which mean 1440 distinct ciphertexts can be obtained for the same message daily
Bit-based cube rotation for text encryption
Today's rapid technological developments make information increasingly important. Not just its content, but the channels or media used for information distribution also need to be secured. Information security is an important aspect that requires serious attention. One of the most important parts of information security is implementation of encryption using certain methods or techniques. This study proposes bit-based cube rotation to secure a plaintext. The aim is to produce a ciphertext that satisfies the two properties of cryptography through diffusion to produce confusion. The result shows that in a normal sentence, there is a significant change in the ciphertext which has the highest avalanche effect value of 55.47% and a correlation coefficient of 0.115. This result proves that the bit-based cube rotation can produce a good ciphertext, where the encryption result is not influenced by its original text
Cryptography: Recent Advances and Research Perspectives
Cryptography is considered as a branch of both mathematics and computer science, and it is related closely to information security. This chapter explores the earliest known cryptographic methods, including the scytale, Caesar cipher, substitution ciphers, and transposition ciphers. Also, explains the evolution of these methods over time. The development of symmetric and asymmetric key cryptography, hash functions, and digital signatures is also discussed. The chapter highlights major historical events and technological advancements that have driven the need for stronger and more efficient encryption methods. In addition, the chapter explores the potential for integrating artificial intelligence tools with cryptographic algorithms and the future of encryption technology
Cryptographic Interweaving of Messages
During the past several decades, the information and communication technology sector has advanced significantly, enabling extensive information interchange over the internet, including message sharing and electronic transactions. These days, the main issue is how to transmit information securely. From ancient times, there has been interest in the field of cryptography research. A masterwork of cryptography is Muni Kumudendu's original work, Siribhoovalaya. His study served as the basis for the method suggested in this publication. Several messages can be sent using different keys utilising a single matrix. Encryption uses a variety of matrix traversal techniques, making it challenging for cryptanalysis to map the plaintext and ciphertext
Permutation Polynomials over Finite Fields and their application to Cryptography
The aim of the paper is the study of Permutation Polynomials over finite fields and their application to cryptography. In this paper, I will begin by a brief review of finite fields, define permutation polynomials over finite fields and their properties. I will present old results such as Hermite-Dickson’s Theorem as well as some most recent ones. After introducing cryptog- raphy, I will give a historical overview, by explaining some cryptosystems such as RSA and ElGamal. Finally, I will present some cryptographical protocols based on Permutation Polynomials over Finite Fields
Design a cryptosystem using elliptic curves cryptography and Vigenère symmetry key
In this paper describes the basic idea of elliptic curve cryptography (ECC) as well as Vigenère symmetry key. Elliptic curve arithmetic can be used to develop elliptic curve coding schemes, including key exchange, encryption, and digital signature. The main attraction of elliptic curve cryptography compared to Rivest, Shamir, Adleman (RSA) is that it provides equivalent security for a smaller key size, which reduces processing costs. From the theorical basic, we proposed a cryptosystem using elliptic curves and Vigenère cryptography. We proposed and implemented our encryption algorithm in an integrated development environment named visual studio 2019 to design a safe, secure, and effective cryptosystem
Hiding algorithm based fused images and Caesar cipher with intelligent security enhancement
The process of sending confidential data through the communication media and in complete secrecy is now necessary, whether the data is related to patients, a particular military operation, or a specified office. On the other hand, with the development of various ciphering algorithms, and information hiding algorithms, there is a need to obtain ciphered and hidden data securely without the need to exchange secret keys between the two ends of the communication. In this paper, a hiding algorithm based on fused images and Caesar cipher with intelligent methods to strengthen the security of confidential information is proposed. Firstly, fused image scattering is obtained using 1’s complement and circularly shifting the bits of fused pixels by specified positions before the hiding process. Secondly, the keys for the Caesar cipher are derived from the length of secret information according to the mathematical equation. Thirdly, strengthen the security of Caesar’s cipher by taking a 1’s complement of each letter in the cipher data. The results guarantee the security of the presented algorithm
Text security by using a combination of the vigenere cipher and the rubik's cube method of size 4Ă—4Ă—4
Background: In the current era of technology, information security is increasingly important. The growth of technology leads to a higher level of threat to the security of data and information dissemination, and cryptography is a valuable protective tool.Aim: The primary objective of this research is to enhance text security through the fusion of the Vigenere cipher and the Rubik's cube algorithm. By leveraging this novel approach, we aim to fortify the confidentiality of textual data against potential eavesdroppers and adversaries. To demonstrate the practicality of this method, we perform a simulation using the Python programming language within the Google Colab environment. Method: This study employs a qualitative research methodology supplemented by empirical simulation. The combination of the Vigenere Cipher and the Rubik's Cube algorithm in a 4Ă—4Ă—4 configuration is implemented to encrypt and decrypt text. The simulation is executed using the Google Colab platform, enabling a practical illustration of the encryption process.Result: The results of our research indicate the feasibility of generating ciphertext through the amalgamation of the Vigenere Cipher and the Rubik's Cube algorithm in the specified 4Ă—4Ă—4 configuration. The simulation conducted in Google Colab serves as concrete evidence of the effectiveness and practicality of this combined encryption method.Conclusion: In conclusion, this research offers a compelling approach to bolstering text security in the modern era of information technology. By combining the Vigenere Cipher with the Rubik's Cube algorithm in a 4Ă—4Ă—4 configuration, we have demonstrated the potential to significantly enhance the confidentiality of sensitive textual data. The empirical simulation conducted in Google Colab reaffirms the practicality and viability of this innovative encryption technique, highlighting its potential as a valuable tool in the realm of information security
A New Hybrid Cryptosystem Involving DNA,Rabin, One Time Pad and Fiestel
Information security is a crucial need in the modern world. Data security is
a real concern, and many customers and organizations need to protect their
sensitive information from unauthorized parties and attackers. In previous
years, numerous cryptographic schemes have been proposed. DNA cryptography is a
new and developing field that combines the computational and biological worlds.
DNA cryptography is intriguing due to its high storage capacity, secure data
transport, and massive parallel computing. In this paper, a new combination is
proposed that offers good security by combining DNA, the Rabin algorithm, one
time pad, and a structure inspired by Fiestel. This algorithm employs two keys.
The first key is a DNA OTP key which is used for only one secure communication
session. The second key, which combines the public and private keys, is a Rabin
key. Additionally, by using a Feistel inspired scheme and randomness provided
by DNA, the ciphertext is made harder to obtain without the private key.Comment: 11 page
- …