Ciphertext Research Articles

Novel chaotic image cryptosystem based on dynamic RNA and DNA computing

In view of the security problems of image encryption algorithms encoded by single DNA or RNA, to increase the randomness of the diffusion process and the uncertainty of the coding rules, we propose a combining dynamic RNA and DNA computing based chaotic image encryption algorithm, which has a more complicated encryption process for improving the security of the encryption algorithm and increases the difficulty of decoding. First, a new three-dimensional hyperchaotic map is proposed, which exhibits a rich set of dynamic behaviors. Second, the sequences generated by the proposed map are passed to NIST test with good randomness and implemented by digital signal processing hardware, which shows the feasibility of the proposed chaotic map for industrial applications. Second, the K-means algorithm is used to split the plaintext into two parts. Third, the chaotic sequence is used to displace and diffuse the two parts of the plaintext, respectively. Then, chaotic sequences were used to encode using dynamic DNA and RNA of these two parts, respectively. Then, the chaotic sequences were used to compute the dynamic DNA and RNA computing of these two parts, respectively. Finally, the cipher text is decoded accordingly. The experimental results show that compared with some related encryption algorithms, our method has higher security.

Evaluation of Rijndael Algorithm for Audio Encryption by Brute Force Attack

The use of information transfer is a major reason for the spread of information piracy, especially digital information that includes audio or other information, to preserve data. Encrypting voice messages is considered one of the most secure ways to protect information due to the difficulty of disclosing it. Our algorithm is robust, effective, efficient, and has security capabilities due to the different key lengths and block sizes (128 bits, 192 bits, or 256 bits). The Rijndael algorithm is an effective tool for encoding audio files and has won many awards. The Rijndael algorithm is compatible with many different audio formats. We will use it to encrypt WAVE files. The first step is to generate keys using the proposed method consisting of key lengths and block sizes (128 bits, 192 bits, or 256 bits). We convert the audio data into a 256 sample. After that, the cipher text will be generated for us. Once we encrypt the audio file, we will have several audio files. We will then use a proactive approach to evaluate the success of this initiative through a brute force attack to break the code. The Rijndael algorithm plays a role in this study by demonstrating the effectiveness of encryption, Reijndeal encryption, is designed to withstand brute force attacks, employs a strong key, proper encryption algorithm, secure hardware, and software to prevent side-channel attacks, and thwart cryptanalysis attempts. It also offers a cutting-edge perspective. Its primary goal is to protect data across the digital landscape during transmission, storage, and protection processes.

Self-Invertible Key on Cipher Polygraphic Polyfunction with Eigen Matrix based IMIE

Hill Cipher’s System and its modifications are still practiced mainly in sending a secret message involving images. One drawback that the recipient of the message is trying to overcome is to get the decryption key from the cipher text to plain text during the decryption process. Previous studies have proven that using self-invertible keys can reduce the computation cost to obtain this key. This paper generates a self-invertible matrix based on Integer-Entry Matrix with all Integer Eigenvalues (IMIE). Subsequently, we executed it into Cipher Polygraphic Polyfunction Cryptosystem and observed the effect.

Enhance Key Stage Generation for Developing Kasumi Encryption Algorithm

Today, data security is a critical component of the efficient performance of every organization's diverse requirement, one of the important requirements is to provide a secure connection for data transmission in organization's networks. Cryptography algorithms are used to protect transmitted data from unauthorized access. Every day, a great deal of research is being done. The process of encrypting data is currently under development. Therefore, a substantial technological or research effort is still required. Cellular networks and secure communication. This proposal calls for the development of a new encryption system based on Using random keys in all the rounds. That’s mean we generated random keys as 128 bits for each round and save it in an array with size (8×8) because we have 8 rounds and each key divided into 8 sub keys as 16 bits for each to use in encryption and decryption. The developed random keys and traditional algorithm keys were tested with statistical tests of NIST, which made up a comparison and conclusion that the developed keys have a higher randomness specially in linear complexity, Frequency within block and random excursion tests, which leads to a better quality of encryption. Then we could test the cipher text with frequency within block test that was evaluated by (0.49590998713105255) and the approximate entropy test that was evaluated by (0.4922198616875501) for each cipher text which resulted from standard and modified Kasumi algorithm that’s means we can conclude that our modified Kasumi algorithm achieved more secure data in its resulted cipher text.

Enhance Key Stage Generation for Developing Kasumi Encryption Algorithm

Today, data security is a critical component of the efficient performance of every organization's diverse requirement, one of the important requirements is to provide a secure connection for data transmission in organization's networks. Cryptography algorithms are used to protect transmitted data from unauthorized access. Every day, a great deal of research is being done. The process of encrypting data is currently under development. Therefore, a substantial technological or research effort is still required. Cellular networks and secure communication. This proposal calls for the development of a new encryption system based on Using random keys in all the rounds. That’s mean we generated random keys as 128 bits for each round and save it in an array with size (8×8) because we have 8 rounds and each key divided into 8 sub keys as 16 bits for each to use in encryption and decryption. The developed random keys and traditional algorithm keys were tested with statistical tests of NIST, which made up a comparison and conclusion that the developed keys have a higher randomness specially in linear complexity, Frequency within block and random excursion tests, which leads to a better quality of encryption. Then we could test the cipher text with frequency within block test that was evaluated by (0.49590998713105255) and the approximate entropy test that was evaluated by (0.4922198616875501) for each cipher text which resulted from standard and modified Kasumi algorithm that’s means we can conclude that our modified Kasumi algorithm achieved more secure data in its resulted cipher text.

Harris Hawk optimization driven adaptive image encryption integrating Hilbert vibrational decomposition and chaos

Image encryption is a technique used to protect the confidentiality of digital images. Existing encryption algorithms use chaotic maps for generating random sequences. These sequences purely depend on the fixed initial parameters, which are not adaptive to different input images, thereby limiting their ability to produce the best-possible encrypted image. This paper introduces a new Harris Hawk optimization (HHO) based adaptive image encryption algorithm that integrates Hilbert vibrational decomposition (HVD), and multiple chaotic maps. The new fitness function is specifically designed to optimize the security and robustness of the encrypted image, considering statistical and differential attack parameters (NPCR, UACI, Entropy, and correlation coefficient values). HHO is used to optimize the initial parameters of chaotic maps (Henon map, Duffing map, Lorenz equation) subject to variations in the input image. In the confusion stage, the input image is decomposed into four components of same dimension but decreasing energy using HVD. Subsequently, the block based pixel scrambling is performed on alternate components using the Henon map and Duffing map. In the diffusion stage, the image from the confusion stage undergoes a first level diffusion by bitwise XOR operation with a random image generated from the Lorenz equation. Further, second level of diffusion is achieved with a complex operation generated image from the input image, enhancing its adaptability. Finally, Arnold Cat map having number of iterations determined by the input image is used for final pixel permutation to produces the encrypted image. The optimized initial parameters and input image dependent confusion and diffusion operations enable the encryption system to adapt to changes in the input image, thereby enhancing its resistance against known plain text and known cipher text attacks. Moreover, the integration of HVD with multiple chaotic maps makes the scheme more complex to decrypt with plain text attacks. The performance of proposed algorithm is evaluated on five standard test images in terms of security and quality measures. Experimental results exhibit statistical and differential attack parameters close to ideal values (with Max. Entropy≈7.9996, Min. CC≈ 10−5, Max. NPCR≈99.64, Max. UACI≈33.62). The use of multiple chaotic maps at different stages makes the key space larger. Robustness analysis demonstrates the algorithm's capability in withstanding noise and image enhancement attacks. The comparison with state of the arts metaheuristic based and classical encryption algorithms highlights the superior performance of proposed HHO driven algorithm. The significant improvement in security parameters and overall fitness compared to fixed initial parameters is achieved by optimizing the encryption process.

A New Technique to Generate Ciphertext from Reversed Plaintext Code

Information security involves safeguarding sensitive data and IT networks from unauthorized access and cyber-attacks. To address this need, various techniques and algorithms have been introduced. In this context, we propose a new technique aimed at protecting information from diverse threats, enhancing user confidentiality, and ensuring high data integrity and availability. In this paper, we introduce a method for generating cipher text by performing multiple rounds of operations. In the first round, we convert the plaintext into ASCII code, then into hexadecimal, and subsequently reverse the code. These transformed values are then stored in blocks, where various operations are performed to generate the cipher text. Keywords: Cryptography, Security, Encryption, Decryption, Key size.

Improvement the International Data Encryption Algorithm(IDEA)based on Chaos Theory

Background: The (IDEA), which represents International Data Encryption Algorithm is a widely used cipher algorithm that has raised concerns due to the discovery of numerous weak keys, as highlighted in previous research. These weak keys, specifically those containing consecutive sequences of single digits, have been found to impede the algorithm's evolution and result in a sluggish avalanche effect. To address these vulnerabilities, this research aims to develop an enhanced and secure encryption algorithm by incorporating Chaos Theory principles into IDEA. Materials and methods: The primary objective is to address the weaknesses associated with IDEA's key generation process by leveraging Chaos Theory to generate strong, highly random keys that replace the algorithm's weak keys t. The study also aims to assess the security and cryptographic strength of the enhanced IDEA algorithm through evaluations and comparisons with the original algorithm. Results: The results showed that the proposed key passed 11 tests out of the 15 total tests, while the Traditional key of IDEA passed only 7. This indicates that the proposed method is superior by 4 tests over the Traditional method of generating keys. Also, cipher text 1 with the proposed key passed 10 tests out of the 15 total tests, while with the Traditional key passed only 8 . Conclusion: This indicates the superiority of the proposed method of IDEA in encryption over the traditional method of IDEA.

A Proposed Text Encryption inside Video Using Harris Corner Detection and Salas20 Encryption Algorithm

يعد تشفير النص في الفيديو أداة حيوية في العديد من الصناعات حيث تكون حماية المعلومات الحساسة هي الأكثر أهمية. عادةً ما تواجه الخوارزميات وطرق الكشف الآلي صعوبة في تحديد موقع النص المخفي في إطارات الفيديو. تزيد هذه المقاومة من أمان المعلومات المخفية لأنه من الصعب على الأطراف غير المدعوة اكتشاف وجود نص مشفر. كما أنه يجمع بين المحتوى المكتوب والمرئي لتقديم كلا النوعين من المعلومات في وقت واحد وبسلاسة. في هذا البحث ، نقدم طريقة جديدة لتشفير النص داخل الفيديو باستخدام خوارزمية التشفير Salsa20 و Harris Corner Detection. الهدف من هذه الدراسة هو زيادة سرية وأمن المعلومات النصية المضمنة في محتوى الفيديو ، وهناك خطوتان أساسيتان في المنهجية المقترحة. لتحديد الزوايا أو النقاط المهمة داخل إطارات الفيديو ، تم استخدام طريقة Harris Corner Detection لأول مرة. تعمل هذه الزوايا كنقاط ميزة قوية يمكن استخدامها لدمج النص. تساعد طريقة Harris Corner Detection في تحديد الأماكن التي قد يتم إخفاء النص بها بدقة ، وذلك دون التقليل من جودة الصورة المرئية الإجمالية للفيديو ، وثانيًا ، يتم إنشاء مفتاح التشفير باستخدام تقنية التشفير Salsa20. Salsa20 هو تشفير دفق شائع يوفر تشفيرًا موثوقًا وتشغيلًا فعالاً. يتم تحويل النص المضمن إلى نص تشفير بواسطة XOR باستخدام مفتاح التشفير قبل تضمينه في الفيديو ، مما يضمن سريته وحمايته من الوصول غير المصرح به. تكشف مقارنة الطريقة المقترحة مع طرق تشفير النص الحالية عن عدد من المزايا. تدمج تقنية Harris Corner Detection النص في إطارات الفيديو بحيث يتم دمجها بشكل أقل وضوحًا ، مما يجعل من الصعب على الخصوم تحديد وجود المعلومات المخفية. يضمن استخدام Salsa20 أيضًا المستوى العالي من الأمان والحماية للنص المشفر ، والدفاع عنه ضد الهجمات المحتملة. يتم تقييم النظام المقترح باستخدام MSE و PSNR والارتباط و NPCR و UACI والإنتروبيا ، وتوفر مقاييس التقييم هذه نتائج ممتازة.

Key-Plain Mapping Algorithm: A Symmetric Key Cryptographic Technique for Secure Communication

Abstract:- In the realm of cryptography, ensuring secure communication is paramount. Symmetric key cryptographic techniques offer a robust means of encryption and decryption. The Key-Plain Mapping Algorithm presents a novel approach to symmetric key cryptography, utilizing a fixed keyword and systematic mapping between plaintext and ciphertext alphabets. This thesis delves into the principles, operations, and security aspects of the Key-Plain Mapping Algorithm, demonstrating its efficacy in securing digital communication. Keywords:- plain text; cipher text or encrypted message; encryption; decryption; symmetric key cryptography; decrypted message; keyword

AES 128 Bit Optimization: High-Speed and Area-Efficient through Loop Unrolling

This study introduces a high-throughput FPGA implementation of AES-128, prioritizing efficiency for robust security and fast data processing needs. AES-128 is renowned for its security and widespread use in various applications. Employing techniques like loop unrolling and pipelining, the implementation maximizes throughput and customizes AES for FPGA architectures. A novel optimization approach, "new-affine-transformation," reduces resource demands and latency for the Sub-Bytes function. The AES architecture is strategically modified for efficiency, with rearranged functions and streamlined processing. The implementation, in VHDL and utilizing Xilinx Virtex-5 FPGA, achieves remarkable performance: 37.9 Gbps (encryption) and 38.5 Gbps (decryption) throughput at frequencies of 296.789 MHz (encryption) and 300.806 MHz (decryption). Resource utilization is efficient, with 264 (encryption) and 260 (decryption) slice registers and 1044 (encryption) and 1581 (decryption) total slices. Keywords: AES, FPGA, cryptography, encryption, decryption, throughput, plain text, cipher text

Data Secure De-Duplication in Cloud Environment

In the current area of information explosion, users’ demand for data storage is increasing, and data on the cloud has become the first choice of users and enterprises. Cloud storage facilitates users to backup and share data, effectively reducing users’ storage expenses. As the duplicate data of different users are stored multiple times, leading to a sudden decrease in storage utilization of cloud servers. Data stored in plaintext form can directly remove duplicate data, while cloud servers are semi-trusted and usually need to store data after encryption to protect user privacy. In this paper, we focus on how to achieve secure re-duplication and recover data in ciphertext for different users, and determine whether the indexes of public key searchable encryption and the matching relationship of trapdoor are equal in cipher text to achieve secure de-duplication. For the duplicate file, the data user’s re-encryption key about the file is appended to the ciphertext chain table of the stored copy. The cloud server uses the re-encryption key to generate the specified transformed ciphertext, and the data user decrypts the transformed ciphertext by its private key to recover the file. The proposed scheme is secure and efficient through security analysis and experimental simulation analysis.

Adaptive Critic Design for Event-Triggered Tracking Control in Discrete-Time on Linear Systems with Observers

This research pioneers an innovative methodology for the bespoke manufacturing of SquidSkin safety products, meticulously tailored to the distinct requisites of diverse industries encompassing medical, military, and defense sectors. The triple DES algorithm is a three instance of DES on same plain text in blocks of 64 bits and converts them to cipher text using keys of 168 bits. The triple DES encryption process creates cipher text, which is an unreadable, effectively indecipherable conversion of plaintext data, the version of information that humans can read and understand. The output of the encryption process, the triple DES cipher text, cannot be read until a secret triple DES key is used to decrypt it. The delineation of industry- specific manufacturing parameters mandates a nuanced approach to material composition and production processes, culminating in a paradigmatic advancement in safety product customization. Integral to this methodology is a rigorous analysis of industry-specific requirements, guiding the selection of optimal material compositions. This selection is underpinned by a meticulously designed material testing phase, ensuring adherence to exacting industry standards and performance benchmarks. Augmenting this paradigm is an imperative emphasis on fortifying the security framework underpinning the handling of proprietary manufacturing data. The proposal introduces an advanced cryptographic architecture, featuring encryption and decryption protocols. Approach assures heightened efficiency, unwavering reliability, and the preservation of proprietary information across varied industry sectors.

Ensuring Privacy and Recovery: Public Key Encryption for Secure Data De-Duplication with Keyword Search

In the current era of information explosion, user’s demand for data storage is increasing, and data on the cloud has become the first choice of users and enterprises. Clous storage facilitates the backup and sharing of data, efficiently reducing user’s storage expenses. The duplicate data of different users is stored multiple times, leading to a sudden decrease in the storage utilization of cloud servers. Data stored in plaintext form can directly remove duplicate data, while cloud servers are semi-trusted and usually need to achieve secure de-duplication and recover data in cipher text for different users, and relationship of trapdoor are equal in cipher text to achieve secure de-duplication. The proposed scheme is secure and efficient through security analysis and experimental simulation analysis. Keywords: Data De-duplication, Mobile Edge Computing, Authentication, Security, Cryptographic Techniques, Data Integrity.

Asymmetric multi-image encoding and hiding scheme with structured fingerprint phase masks using gyrator transform and phase-shifting digital holography

We propose a novel technique for multi-image encryption and hiding schemes under an optical asymmetric framework using structured fingerprint phase masks (SFPMs) in the gyrator transform (GT) domain and three-step phase-shifting digital holography (PSDH). A SFPM contains unique features of fingerprint and structured phases of the optical vortex beam, which provides enhanced security in the cryptosystem. To encrypt multiple images, GT-based phase truncation and phase reservation techniques have been used in the first level of security, whereas three-step PSDH has been used to obtain the final cipher text. The cipher text is embedded in the host image to perform the watermarking process. In this process, the host is further decomposed into three parts in which anyone from the last two parts can be used for watermark embedding, and the first part is stored as the key. The use of polar decomposition in the watermarking process provides an additional layer of security. Numerical simulations and experimental results are presented to support the proposed scheme.

Attribute Based Signature Encryption Scheme Based on Cloud Computing in Medical Social Networks

The emergence of mobile medical social networks has provided great convenience for patients to communicate with each other about their medical conditions, promoting efficient and high-quality communication and exchange among patients. However, at the same time, it has also raised issues of confidentiality and privacy of patient data. In response to this issue, this article proposes a cloud-based attribute-based signature encryption scheme that can effectively protect the privacy of patient data. The patient encrypts their medical information and uploads it to the cloud server. When the data user wants to access the patient’s information, the cloud server helps the data user partially decrypt and verify the integrity of the data, which to some extent reduces the computational workload of the data user. Meanwhile, under the random oracle model, it has been proven that the scheme satisfies the unforgeability under selective message attacks, indistinguishability under selective cipher text attacks, and attribute privacy security. Theoretical analysis and numerical simulation experiments show that this scheme has higher efficiency than existing schemes in the signing and decryption stages.

An Enhanced AES-ECC model with Key Dependent Dynamic S-Box for the Security of Mobile Applications using Cloud Computing

The spectacular growth of computational clouds has drawn attention and enabled intensive computing on client devices with constrained resources. Smart phones mostly use the data centre demand service model to provide data to computationally intensive applications. It is challenging to outsource sensitive and private information to distant data centres due to growing concerns about data privacy and security. Therefore, conventional security algorithms have to be upgraded to address the brand-new security concerns that have emerged in the cloud environment. The Advanced Encryption Standard (AES) algorithm encrypts and decrypts messages using the four steps, namely Sub-Bytes, Shift-Rows, Mix-Columns, and Add Round Key. It has been changed so that the Sub-byte transformation depends on the round key. Making the S box round key dependent is intended to make it such that even a little change in the key will have a big impact on the cipher text. The avalanche effect and execution time of the standard and modified AES algorithms are implemented and assessed. In order to suggest a safe and efficient solution, the study also aims to modify the shift rows and the mix column phases of AES. Using cryptographic techniques such as elliptic curve cryptography (ECC), several protocols and algorithms have been developed to guarantee the security and integrity of the data. The proposed solution combines the enhanced and updated The Advanced Encryption Standard (AES) technology with the ECC to guarantee data secrecy. The avalanche effect approach is used in this study to explore and analyze the strength and quality of the new s-box. The results demonstrated that each encryption operation generates a unique cipher text. A strong avalanche effect was also achieved with the redesigned dynamic s-box using irreducible polynomials, surpassing the strict avalanche criterion (SAC). The results show that the proposed method ECC-EAESKDS Elliptic Curve Cryptography-Enhanced AES with Key Dependent S box is efficient and yields better results than the alternatives. According to the suggested security architecture, cloud users may control data protection and integrity in a secure manner.

Design And Implementation of Network Security Using Neural Network

The number of internet users is increasing day by day. To keep internet surfing safe from vulnerable exploits we need to design new powerful algorithm. Hence this paper is mainly concerns with implementation of Neural Network using symmetric key cryptography to ensure confidentiality, authentication, integrity and message non-repudiation. In order to achieve the above objectives first an encryption algorithm is developed and implemented. The program takes a plain text as an input from the user to generate an intermediate cipher text and sends it to the source node of the neural network. At this point the intermediate cypher text is passed through some successive hidden layers of neural network’s concept to produce final cipher text. Now to recover the plain text from the final cipher text a decryption algorithm is developed and implemented.

A Multilayer Data Security Using Matrix Transformation and RSA For Public Cloud Storage

Cloud computing is an internet-based system that allows clients to access computers, software, infrastructure, devices, and other resources through a subscription model. Data security is a major concern for the cloud computing model. Data security is a research challenge in any cloud environment. When cloud users upload their confidential and secret data through the cloud, the security of this data must be ensured. In order to improve data security, a new method is presented in this paper. The approach uses ten random prime integers to compute the public and safe private keys after transforming user data into a matrix format. The encrypted content is then decrypted using the secured private key, improving total data security. The Hackman tool is used to analyse the encryption and decryption times as well as the security level. The OPNET tool measures the power of encryption and decryption. The findings indicate that all five potential file sizes for the proposed algorithm's parameters have the highest value. The cypher text was analysed using this suggested technique using brute force and dictionary attacks. This method is more effective, more secure, and impenetrable.

A Compact Hardware Design and Implementation on FPGA Based Hybrid of AES and Keccak SHA3-512 for Enhancing Data Security

Data security means protecting important information from unauthorised persons. In a security system, cryptography is the most secure method. Cryptography has many kinds, but the Advanced Encryption Standard (AES) is the most secure system. If combined with AES and Secure Hash Algorithm-3-512Bits (SHA3-512), it becomes compact, more secure, and more authenticated for data communications. The proposed methodology is a hybrid cryptography technique that combines AES with the SHA3-512 algorithm. This system becomes a strong, secure system and produces a strong cipher text. The proposed method AES/SHA3-512 is Hardware implementation on the Artix-7 FPGA family yields the lowest cost and highest hardware efficiency with a reduction in area usage of LUT 18.49%, Flip Flops 0.83%, and IO 3.8%. The proposed architecture is synthesised and simulated using the Vivado 2017.2 version Tool.