Encryption Of Plaintext Research Articles

Transparent Encryption for External Storage Media with Mobile-Compatible Key Management by Crypto Ciphershield

Evidently, there is a widespread adoption of external storage devices in contemporary situations, including USB sticks, SD cards, and flash memory devices. If, on the other hand, these devices are misplaced or lost, the presence of sensitive data on them can provide a potential security risk. The currently available encryption solutions frequently have usability issues, which necessitate that users continually input keys or login credentials across a variety of portable devices. The study offers a solution that overcomes these difficulties by integrating key caching with time-delayed deletion within the MobileShielded Encryption Framework (MoSEF). This method is our reaction to the problem. There are two distinct iterations of this idea that we have developed. The initial version, which functions flawlessly even in the absence of deliberate user intervention, achieves this by restricting the use of external storage to only temporary data transfers.Within the file system, the second variant makes it possible to handle numerous encryption keys for different files. This is made possible by a trusted host on the file system. By eliminating the need to share keys or passwords, timed key caching significantly improves both the level of security and the level of usability of a system. In addition to ensuring interoperability with mobile devices, our solution, which is incorporated within the MoSEF architecture, provides plaintext encryption for external storage media. To reduce the likelihood of data breaches and illegal access, this strategy offers users a mechanism that is both convenient and safe for managing sensitive data when they are on the move.

A secure and privacy-preserving technique based on coupled chaotic system and plaintext encryption for multimodal medical images

A secure and privacy-preserving technique based on coupled chaotic system and plaintext encryption for multimodal medical images

Multi‐lingual encryption technique using Unicode and Riemann zeta function and elliptic curve cryptography for secured routing in wireless sensor networks

AbstractSecure routing and communication with confidentiality based on encryption of texts in multiple natural languages are challenging issues in wireless sensor networks which are widely used in recent applications. The existing works on Elliptic Curve Cryptography based secured routing algorithms are focused only on the encryption and decryption of single language text encrypted over a Prime finite field. In this article, a new algorithm called Multi‐Language ECC encrypted Secure Routing algorithm with trust management is proposed, in order to ensure confidentiality and integrity which focuses on the encryption of plain text using Riemann's zeta function and Elliptic Curve Cryptography for improving the key strength which is applied for encryption over a range of multi languages namely Tamil, English, Hindi French and German which are supported by Unicode and routing the text security. From the experiments conducted using the proposed multi‐lingual encryption algorithm with network routing, we prove that the suggested method provides greater security than the current secure routing algorithms due to the use of Zeta function and Gamma function with ECC key and trust management. but also boasts reduced complexity compared to other existing multi‐lingual encryption algorithms.

Verifiable Encryption from MPC-in-the-Head

Verifiable encryption (VE) is a protocol where one can provide assurance that an encrypted plaintext satisfies certain properties, or relations. It is an important building block in cryptography with many useful applications, such as key escrow, group signatures, optimistic fair exchange, and others. However, the majority of previous VE schemes are restricted to instantiation with specific public-key encryption schemes or relations. In this work, we propose a novel framework that realizes VE protocols using zero-knowledge proof systems based on the MPC-in-the-head paradigm (Ishai et al. STOC 2007). Our generic compiler can turn a large class of zero-knowledge proofs into secure VE protocols for any secure public-key encryption scheme with the undeniability property, a notion that essentially guarantees binding of encryption when used as a commitment scheme. Our framework is versatile: because the circuit proven by the MPC-in-the-head prover is decoupled from a complex encryption function, the work of the prover is focused on proving the encrypted data satisfies the relation, not the proof of plaintext knowledge. Hence, our approach allows for instantiation with various combinations of properties about the encrypted data and encryption functions. We then consider concrete applications, to demonstrate the efficiency of our framework, by first giving a new approach and implementation to verifiably encrypt discrete logarithms in any prime order group more efficiently than was previously known. Then we give the first practical verifiable encryption scheme for AES keys with post-quantum security, along with an implementation and benchmarks.

A Realizable Data Encryption Strategy

As technology continues to advance, data has become an increasingly important element in the sphere of Information Technology. However, enormous data generated by devices presents a major challenge in handling it in real time. Data encryption is a crucial component in ensuring data security and privacy during its transmission in network. Unfortunately, many applications disregard data encryption in order to achieve higher performance. The work proposes a solution to this problem by introducing a data encryption process that is, the Realizable Data Encryption Strategy (RDES) and Deoxyribonucleic Acid (DNA) computing, a revolutionary cryptographic method that improves information security by preventing authorized access to sensitive data, being used. Information security is improved by DNA symmetric cryptography being suggested. The outcomes show that plain-text encryption is a very secure procedure. The RDES approach is designed to improve privacy protection within the constraints of real-time processing. By implementing the RDES approach, data privacy and security can be significantly enhanced without compromising performance.

Three Pass Protocol for Key Security Using Affine Cipher Algortima and Exclusive-or (Xor) Combination

Information is a very important concern in today's technological era, especially in terms of security through the exchange of information that is so fast that people can easily get various kinds of information. Information obtained easily through recording or openly disseminating data, XOR Cipher is an algorithm used to secure messages and texts but has weaknesses due to simple computation, therefore to strengthen security in XOR Cipher communication protocols can be added to secure key exchange on XOR Ciphers. Affine Cipher can be combined with Exclusive-OR (XOR) for text message security. Through the Affine Cipher algorithm with Key can change the unknown Plaintext, so that the Plaintext is kept secret. The Exclusive-OR (XOR) combination by changing each Character in each Plaintext according to the ASCII Code table can shorten the Key encoding process, so that Plaintext remains safe to send. The Affine Cipher Algorithm and the Exclusive-OR (XOR) Combination for Plaintext security levels are better because the Plaintext encryption and decryption processes are carried out twice with different cryptographic algorithms.

Colour image encryption algorithm using Rubik’s cube scrambling with bitmap shuffling and frame rotation

The 21st century has seen a significant increase in the usage of multimedia to transfer information. Algorithms used for the encryption of plain text are not suitable for multimedia encryption. This paper proposes a new and unique algorithm - Rubik’s cube scrambling with Bitplane shuffling and Frame rotation (RBF) for the encryption of coloured images. RBF is a symmetric key algorithm that takes two 128-bit key inputs from the user. The algorithm uses Rubik’s cube moves for generating scrambling sequences, followed by the shuffling of the bitplanes to generate the encrypted image. A distinctive frame rotation technique is applied to each of the bitplanes in the encryption process. The RBF algorithm is simple and straightforward to implement but produces satisfactory results. The algorithm is evaluated using a range of multimedia data. The paper also describes the various analysis tests and results of the algorithm in detail. Overall, the algorithm demonstrates its value for encrypting many types of multimedia data with practical applications.

Strike: Stream Cipher Based on Stochastic Lightning Strike Behaviour

There is an increasing need for secure and fast encryption algorithms to support applications and communication protocols, and business models. In this paper, we present an alternative stream cipher (Strike) inspired by the stochastic behaviour of lightning strike phenomena. The novelty and originality of Strike stem from the utilisation of lightning strike behaviour as a source for generating random keystreams for encryption and decryption. Strike consists of three main functions: a function for setting up the security attributes, a function for generating lightning strikes and converting them to a keystream, and a function for plaintext encryption. The proposed stream cipher was tested against several cryptanalysis and statistical attacks in addition to other performance tests. The results show that Strike achieves high throughput on both high- and low-speed devices. Additionally, security analysis shows that our cipher is resistant to cryptanalysis and statistical attacks.

A new approach of cryptography using taylor series of logarithm function

This study investigated a novel cryptographic approach involving the encryption of plaintext using the coefficients of a Taylor series for the logarithm function multiplied by its corresponding index. The decryption process utilized the Laplace transform of the logarithm function and its inverse. Through this methodology, several innovative mathematical encryptions and decryption formulas were derived. The study also includes a practical example to demonstrate the broader implications of the findings.

An Examination of Multi-Key Fully Homomorphic Encryption and Its Applications

With the rapid development of the Internet of Things (IoT) technology, the security problems it faces are increasingly prominent and have attracted much attention in industry and the academy. Traditional IoT architecture comes with security risks. Illegal intrusion of attackers into the network layer disrupts the availability of data. The untrusted transmission environment increases the difficulty of users sharing private data, and various outsourced computing and application requirements bring the risk of privacy leakage. Multi-key fully homomorphic encryption (MKFHE) realizes operations between ciphertexts under different key encryption and has great application potential. Since 2012, the first MKFHE scheme LTV12 has been extended from fully homomorphic encryption (FHE) and has ignited the enthusiasm of many cryptographic researchers due to its lattice-based security and quantum-resistant properties. According to its corresponding FHE scheme, the MKFHE schemes can be divided into four kinds: Gentry–Sahai–Water (GSW), number theory research unit (NTRU), Brakerski–Gentry–Vaikuntanathan (BGV), and FHE over the tour (TFHE). Efficiency and cost are urgent issues for MKFHE. New schemes are mainly improved versions of existing schemes. The improvements are mostly related to the four parts of MKFHE: security assumption, key generation, plaintext encryption, and ciphertext processing. We classified MKFHE schemes according to the improved partial schemes, and we present some improved techniques and the applications of MKFHE.

Improved affine encryption algorithm for color images using LFSR and XOR encryption.

In this study, a novel Improved Affine Algorithm (IAA) for color image encryption is proposed. Affine Algorithm (AA) is generally known as an algorithm used for plain text encryption. In the proposed IAA algorithm, Linear Feedback Shift Register (LFSR), XOR encryption, and the AA are combined for color images encryption. The plane image is firstly split into three channels: R, G, and B. The RGB channel image is encrypted using AA encryption with ten keys based on pixel locations and pixel values. The rows and columns of the image are encrypted with LFSR keys and XOR encryption procedures. Finally, the proposed algorithm is tested in Matlab environment to obtain the Histogram, Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR), Unified Average Changing Intensity (UACI), Number of Pixel Change Rate (NPCR), and Entropy analyses. The values are compared with other algorithms. The results show that the proposed image encryption algorithm is secure and powerful, outperforming other algorithms.

Secured transmission design schemes based on chaotic synchronization and optimal high gain observers

The distinguishing feature of the proposed secured transmission design scheme is the use of chaotic nonlinear systems and optimal high gain observers for the encryption/decryption operation and their application in image cryptography. The primary concern in this work is to develop an innovative algorithm for optimizing the high gain observer performances. Therefore, the proposed strategy uses a nonlinear chaotic system in the plain-text encryption phase and the optimal high gain observer in the decryption phase with no interdependence between these two operations. Practically, the chaotic system is suitable to be used as a block cipher as it has a random nature depending on its initial conditions. In addition, it is possible to present the proposed block cipher method as an enhancement of the existing block cipher involving short keys. For the decryption, a challenging design combining a high gain observer and non-dominated sorting genetic algorithms (NSGA-II) for optimizing the observation gain is developed. Efficiency and substantial performances of the synchronization method, tested with nonlinear unified chaotic system and optimal high gain observer, are demonstrated by several numerical simulation scenarios on a prominent QR (Quick Response) code example.

The Hill Cipher Algorithm for Data Encryption and Decryption

The science of encoding and decoding signals is known as cryptography. Cryptography is frequently used in people's daily life to keep sensitive data, such as Mastercard data, safe. Many regular exercises can be easily viewed by unintentional outsiders via the Internet. Hill cipher is a simple linear transformation represented by a matrix that is a traditional cryptography based on linear algebra. It is one of the symmetric key algorithms with various data encryption advantages. However, the inverse of the plaintext encryption key matrix is not always available. The encrypted text cannot be decoded if the key matrix is not invertible. The key matrix employed for encryption in the Involutory matrix generation method is invertible. As a result, we do not need to find the inverse of the key matrix during decryption.

Multi-Recipient encryption with keyword search without pairing for cloud storage

With the rapid development of cloud computing technology and communication technology, cloud storage has become a tool used by people in daily life. Cloud storage service enables users to outsource data to cloud servers and retrieve desired document efficiently. Individual privacy in outsource data are very sensitive and should be prevented from any leakage. Public-key encryption with keyword search (PEKS) scheme resolves this tension, while public-key authentication encryption with keyword search (PAEKS) scheme improve its keyword guessing attacks problem potentially. Whereas, the loss of keyword privacy, the limitation of single user interaction and low efficiency make PEKS/PAEKS schemes far from enough in practical applications.In this paper, we develop a multi-recipient public key encryption scheme with keyword search without pairing (MREKS) for cloud storage under public key infrastructure. The proposed scheme has the merits of supporting multi-recipient keyword search way as well as requiring no expensively bilinear pairing operations under standard model. We present a concrete and efficient construction of MREKS, and prove its security based on discrete logarithm assumptions. Furthermore, we embed the algorithm of data plaintext encryption and decryption into the scheme, which makes the scheme more practical. We show that our scheme enjoys much more efficiency than previous PEKS/PAEKS scheme in the simulation experiment, especially the keyword encryption is optimized by 79.5%.

An Efficient Cryptosystem Using Playfair Cipher Together With Graph Labeling Techniques

Cryptography is the branch of Discrete Mathematics which deals with the transmission of secret communications between intended parties without the knowledge of third party. Graph theory is the enchanting field if Mathematics that designate integers to edges and vertices through some established functions. In current scenario security of communication plays a crucial role in any telecommunication or network applications. In this paper we have proposed an efficient cryptosystem using play fair cipher together with graph labeling to safeguard our secret text from unauthorised persons. Here we employ the substitution cipher namely Play fair cipher for plaintext encryption and ourencrypted text in the form of Cipher Graph is forwarded to the receiver which on application of graph labeling yields our plaintext. Thus a fusion of the techniques Cryptography with Graph labeling provides ultimate security for secure transmission of data or information at various levels.

Features of genetic algorithm for plain text encryption

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Processing.

Peningkatan Keamanan Pengiriman Pesan Teks: Kombinasi Advanced Encryption Standard (AES) 128 dan Least Significant Bit (LSB)

Confidentiality in transfer the messages is an important thing to maintain. Increased security in transfer the messages can be improved using cryptography and steganography. This article aims to apply a combination of AES 128 cryptography and LSB steganography in an application, and measures the quality of the stego-image. In this article, the AES 128 algorithm is used for the encryption process of secret messages and the LSB algorithm for the process of inserting secret messages in the cover image. PSNR is used to measure the quality of the stego-image, by comparing the cover image and the stego-image. This research produces an application that can be used for the security of sending text messages by combining the AES 128 algorithm in the plaintext encryption and the LSB algorithm in the secret message insertion process. In term of measuring the quality of the stego-image, it was found that the character length of the secret message would have an impact on the MSE and PSNR values. This means, the longer the character of the secret message will affect the quality of the stego-image.

Practical CCA-Secure Functional Encryptions for Deterministic Functions

Functional encryption (FE) can implement fine-grained control to encrypted plaintext via permitting users to compute only some specified functions on the encrypted plaintext using private keys with respect to those functions. Recently, many FEs were put forward; nonetheless, most of them cannot resist chosen-ciphertext attacks (CCAs), especially for those in the secret-key settings. This changed with the work, i.e., a generic transformation of public-key functional encryption (PK-FE) from chosen-plaintext (CPA) to chosen-ciphertext (CCA), where the underlying schemes are required to have some special properties such as restricted delegation or verifiability features. However, examples for such underlying schemes with these features have not been found so far. Later, a CCA-secure functional encryption from projective hash functions was proposed, but their scheme only applies to inner product functions. To construct such a scheme, some nontrivial techniques will be needed. Our key contribution in this work is to propose CCA-secure functional encryptions in the PKE and SK environment, respectively. In the existing generic transformation from (adaptively) simulation-based CPA- (SIM-CPA-) secure ones for deterministic functions to (adaptively) simulation-based CCA- (SIM-CCA-) secure ones for randomized functions, whether the schemes were directly applied to CCA settings for deterministic functions is not implied. We give an affirmative answer and derive a SIM-CCA-secure scheme for deterministic functions by making some modifications on it. Again, based on this derived scheme, we also propose an (adaptively) indistinguishable CCA- (IND-CCA-) secure SK-FE for deterministic functions. The final results show that our scheme can be instantiated under both nonstandard assumptions (e.g., hard problems on multilinear maps and indistinguishability obfuscation (IO)) and under standard assumptions (e.g., DDH, RSA, LWE, and LPN).

Plaintext-related multiple-image encryption based on computational ghost imaging

ABSTRACTThe traditional ghost imaging encryption system has high pressure in key transmission and management for involving a series of random phase-only masks (POMs) as keys. And conventional ghost imaging encoding is vulnerable to a chosen-plaintext attack owing to the linearity of the system. To address these problems, a plaintext-related ghost imaging encryption system which can reduce the key size and ensure the security of the system was proposed in this study. It uses parameter keys and plaintext information to generate all random POMs for encryption of plaintext. POMs used to encrypt images depend on both parameter keys and plain image, thus protecting information from cracking by the chosen-plaintext. At the same time, a multiple-image encryption method based on plaintext-related ghost imaging encryption was developed to improve the encryption efficiency of the system. The proposed method is the characteristic of strong multiple-image encryption ability, high security and enough simple structure.

Penerapan Algoritma Hill Cipher Dan Least Significant Bit (LSB) Untuk Pengamanan Pesan Pada Citra Digital

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.