Encryption Procedure Research Articles

BIT OPERATIONS WITH ELEMENTS OF THE RSA ALGORITHM IN ENCRYPTION-DECRYPTION OF COLOR IMAGES

An image as a stochastic signal is one of the most common forms of information. Protecting images from unauthorized access and applying is a correspondingly urgent task. This causes the use of well-known classical encryption methods in the case of image encryption. But the image is a signal that possesses, in addition to typical informativeness, also visual informativeness. Informativeness for modern image processing methods makes it possible to ensure unauthorized access. Creating an attack on an encrypted image is possible in two ways: by traditional hacking of encryption methods, or by classical methods of visual image processing (filtering, highlighting contours, etc.). In this regard, one more requirement is put forward to encryption methods in the case of their application concerning images - this is the complete noise of the encrypted image. This is necessary so that the use of visual image processing methods becomes impossible. The RSA algorithm is one of the most widely known industrial standards for encrypting signals. Unlike symmetric encryption, in an open-key encryption scheme, it is impossible to calculate the decryption procedure, knowing the encryption procedure. Namely, the working time of the algorithm for calculating the decryption procedure is so great that it cannot be implemented on any modern computers, as well as on computers of the future. Such coding schemes are called asymmetric. Therefore, the urgent task is to implement the application of the RSA algorithm so that when encrypting an image: – the cryptographic stability of the RSA algorithm has not become worse; – the full image noise was achieved to prevent the use of visual image processing techniques. The algorithm of elements of the RSA algorithm, as the most resistant to unauthorized decryption of signals, and bitwise operations for a compatible combination during encryption and decryption of images is proposed by the authors. Encryption - decryption is performed without additional noise. The proposed algorithm is applied to images in which there are strictly extracted contours. Elements of the RSA algorithm are assigned to perform bitwise operations on the intensity values of pixels of a color image. The developed algorithm has higher cryptographic stability compared to the traditional RSA algorithm. The authors described the possibilities of using elements of the RSA algorithm in bitwise transformations when encrypting and decrypting images. The results of encryption simulation for cryptographic transformations of color images of a given dimension are presented. Modified models and algorithmic procedures of key formation processes of direct and inverse cryptographic transformations have been developed. They are reduced to elemental mathematical operations.

АРХІТЕКТУРА ТА РЕАЛІЗАЦІЯ БАЗОВИХ КОМПОНЕНТІВ СИСТЕМИ НЕЙРОМЕРЕЖЕВОГО ЗАХИСТУ І КОДУВАННЯ ПЕРЕДАЧІ ДАНИХ

The development of basic components of the neural network protection system, data transmission coding based on an integrated approach, which includes an improved method of neural network encryption (decryption) and the method of adaptive barker-like coding (decoding) of data, which focuses on modern element base. The principles of specialization and adaptation of hardware and software to the structure of algorithms for neuro-like encryption (decryption) of data, neural network architecture, and barker-like code are used to develop the system. The architecture of the system is proposed, which takes into account the variable composition of the equipment and modularity. The method of neural network encryption (decryption) of data has been improved. The time of neural network encryption and decryption of data depends on the size of the tables of macroparticle products. The size of the tables of pre-calculated macroparticle products is based on the provision of encryption and decryption of data in real-time. A method of adaptive barker-like encoding (decoding) has been developed, which, due to the signal-to-noise ratio, provides high noise immunity and reduces data transmission time. The hardware of the system, which was created using the developed basic components of neural network protection and barker-like data encoding, is described. When creating hardware, ready-made components and modules of industrial production are used as much as possible, and the availability of appropriate means of software code development is taken into account. Means of neural network cryptographic encryption (decryption) of data of the mobile part of the system are implemented using a microcomputer-based on SoC. Not the most powerful microcomputer of the NanoPi Duo type from FriendlyElec has been especially used to test the means of neural network cryptographic encryption (decryption) of data. Using the created system, it is determined that the performance of neural network cryptographic encryption (decryption) of data blocks based on a microcomputer is carried out in close to real-time. The time of formation and training of the neural network is about 200 ms, and the implementation of encryption and decryption procedures is about 35 ms and 30 ms, respectively, and does not depend significantly on the chosen configuration of the neural network.

Secure Communication Scheme based on A New Hyperchaotic System

This study introduces a new continuous time differential system, which contains ten terms with three quadratic nonlinearities. The new system can demonstrate hyperchaotic, chaotic, quasi-periodic, and periodic behaviors for its different parameter values. All theoretical and numerical analysis are investigated to confirm the complex hyperchaotic behavior of our proposed model using many tools that include Kaplan-Yorke dimension, equilibrium points stability, bifurcation diagrams, and Lyapunov exponents. By means of Multisim software, the authors also designed an electronic circuit to confirm our proposed systems’ physical feasibility. MATLAB and Multisim simulation results excellently agree with each other, which validate the feasibility of our new ten terms hyperchaotic system and make it very desirable to use in different domains especially in chaotic-based communication. Furthermore, by employing the drive response synchronisation, we developed a secure communication strategy for the proposed system. Findings from the proposed scheme show that the proposed approach was successful in completing the encryption and decryption procedure.

Provably Secure and Fast Color Image Encryption Algorithm Based on S-Boxes and Hyperchaotic Map

The World Wide Web is experiencing a daily increase in data transmission because of developments in multimedia technologies. Consequently, each user should prioritize preventing illegal access of this data by encrypting it before moving it over the Internet. Numerous color image encryption schemes have been developed to protect data security and privacy, indifferent to the computation cost. However, most of these schemes have high computational complexities. This research proposes a fast color image scrambling and encryption algorithm depending on different chaotic map types and an S-box that relies on a hyperchaotic map principle. The first step involves converting color image values from decimal representation to binary representation in the scrambling stage by changing the location of the bits according to a proposed swapping algorithm. Next, in the second scrambling stage, the same process occurs after returning color image values from binary representation to decimal representation and generating an S-box with the assistance of two types of chaotic map, namely, a 2D Zaslavsky map and a 3D Hénon map. Thus, this S-box is relied upon to swap the locations of the pixels in the color image. The encryption procedure begins with the production of three key matrices using a hybrid technique that employs two low-complexity types of chaotic map, namely, a 1D Logistic map and a 3D Hénon map, followed by an XORed as a lightweight process between each key generated for the three matrices and the corresponding red, green, and blue image channels. According to the findings, the proposed scheme demonstrates the most efficiency in terms of lowering the computational cost and shows its effectiveness against a wide range of cryptographic attacks.

Gray Image and Colour Image Security using AES Algorithm

For picture security and confirmation we utilize cryptographic. In cryptographic we scramble the information. There are various symmetric and deviated encryption procedures, which are used for encryption and unscrambling reason. Symmetric encryption approach work on ordinary key (same key utilized for encryption and unscrambling reason), but unbalanced work on with one public key and private key. Public key utilized for encryption and private key for unscrambling. The security of the stowing away is measure utilizing the MSE, PSNR, Cross-Correlation and Entropy limits. For better stowing away get the low MSE and high PSNR respects. So to make the rapid reaction we need calculation which requires some speculation and give reaction quick. From this point forward additionally take apart the time reaction of purposed assessments to additionally foster security and expedient response.

Modern cryptanalysis of the Truppenschlüssel

Truppenschlüssel (troop cipher) was a manual cipher used by the German Army during World War II. Based on more than a hundred authentic messages that survived the war, a cryptanalysis is performed. The exact encryption procedure is investigated via two plaintext-ciphertext compromises. A specific ciphertext-only breaking tool is developed, utilizing the hill climbing technique. This leads to successful breaks of most of the messages.

Double layered Fridrich structure to conserve medical data privacy using quantum cryptosystem

To handle pandemic situations like Corona, medical practitioners and researchers collaboratively will work together and transfer medical reports across the globe. Subsequently, it is important to preserve those reports from unauthorised access by providing utmost confidentiality, integrity and authentication. Quantum cryptography depends on quantum mechanics principles such as Heisenberg uncertainty and Photon polarisation, which aims in preventing the bootlegging of the encoded secret data in the quantum state. Quantum Algorithms are recently gaining wide attention among researcher's worldwide in optimising the protocols with adaptive learning and quadratic speed up compared to classical ones. Hence, a quantum assisted medical image encryption algorithm has been devised in protecting the shared reports in this paper. Initially, the medical images in Digital Imaging in Communication and Medicine (DICOM) format will be converted into Novel Enhanced Quantum Image Representation (NEQR) to survive in the quantum environment. Further, combined chaotic generators were utilised to generate random keys, ensuring a larger chaotic range and stability to withstand open communal channel attacks. Furthermore, double-layered Fridrich operations (Confusion and Diffusion) were carried out using the generated keys by adopting Quantum reversible gates. Finally, intra and inter bit permutations were conceded to provide a complete cryptic cipher image with uniform distribution of bits to resist the vulnerable attacks and enhance parallel data encryption procedure speed. Statistical and Differential attack analyses were estimated and compared with state of the art to justify the robustness of the proposed quantum cryptosystem. Also, complexity analysis has been derived to prove the proposed quantum algorithm's computational speedup compared to the classical part.

Novel public-key cryptosystems based on NTRU and algebraic structure of group rings

In this paper, we propose two novel public-key cryptosystems by combining the well-known NTRU public-key cryptosystem with the algebraic structure of group rings. We discuss the security analysis of these cryptosystems and show their enhanced security in comparison to the NTRU public-key cryptosystem. To be more precise, we show that the security of our novel cryptosystems is based on solving some recently discovered hard problems, for instance, Discrete logarithm problems in group rings, Inverse computation problems etc. We also discuss two examples to show the encryption and decryption procedure for both the cryptosystems.

A note on fully homomorphic encryption of real-life data

The purpose of this short paper is to explain the difference between encrypting real-life data and encrypting elements with a ring structure in the context of fully homomorphic encryption (FHE). Specifically, our encryption of real-life data is in two stages. First, we use a private-key embedding of real-life data in a ring; this embedding does not have to be fully homomorphic. This private embedding, speaking informally, takes most of the security burden off the second part of our encryption procedure, namely FHE between rings. The whole encryption function is then not fully homomorphic, but we show that it still provides for the most popular functionalities one expects from FHE, including private search on encrypted data.

From chaos to stability in soliton mode-locked fibre laser system

Intracavity energy rate in a soliton mode-locked fibre laser is derived by solving the Haus master equation. The influence of net gain, absorber response, saturation energy, nonlinearity and absorption are investigated on stable/unstable states. Intracavity modes include the zeroth, first and higher order solitons. Accordingly, chaotic regime as well as breather modes is recognized as a conventional intracavity state. However, tuning the control parameters also results in a reverse bifurcation and thus returning to a stable state. Accordingly, a chaos-based encryption/decryption system is proposed taking the advantage of using a single-side control process; both the encryption and decryption procedures can be achieved by one of the actions of increasing/decreasing the control parameters.

On effective computations in subsemigroups of affine Cremona semigroup and implentations of new postquantum multivariate cryptosystems

Multivariate cryptography (MC) together with Latice Based, Hash based, Code based and Superelliptic curves based Cryptographies form list of the main directions of Post Quantum Cryptography.Investigations in the framework of tender of National Institute of Standardisation Technology (the USA) indicates that the potential of classical MC working with nonlinear maps of bounded degree and without the usage of compositions of nonlinear transformation is very restricted. Only special case of Rainbow like Unbalanced Oil and Vinegar digital signatures is remaining for further consideration. The remaining public keys for encryption procedure are not of multivariate. nature. The paper presents large semigroups and groups of transformations of finite affine space of dimension n with the multiple composition property. In these semigroups the composition of n transformations is computable in polynomial time. Constructions of such families are given together with effectively computed homomorphisms between members of the family. These algebraic platforms allow us to define protocols for several generators of subsemigroup of affine Cremona semigroups with several outputs. Security of these protocols rests on the complexity of the word decomposition problem, Finally presented algebraic protocols expanded to cryptosystems of El Gamal type which is not a public key system.

A Review on Watermarking using Local Binary Pattern

Local binary patterns are best known because of their robust texture-defining capacities and digital watermarking used to prove multimedia content copyright. This work presents an overview of the binary watermark in the image blocks by changing the pixels conveyed by the LBP pattern of the neighborhood. However, different photo blocks can have the same LBP pattern, which in the watermark process can lead to incorrect detection. In other words, without changing your watermark message, one can change the host image deliberately. Moreover, before watermark embedding, there is no encryption procedure, which leads to another potential security problem. In this paper, we examine the identical process of LBP synthesis or reverse LBP and its suitability for the digital watermarking image. The process of LBP synthesis varies by pixel values so that the LBP from these pixels is the required synthesizable value. Due to the LBP synthesis character, the watermark needs to be integrated with only a few pixels of the given block. The results show that rotational, JPEG compression, and scalable attacks are robust with the technique. This LBP synthesis could also be used to justify ownership using watermark sensor data.

Video Steganography Using DNA and Chaotic Sequence

Background: Several activities or task is which are performed with the help of digital technologies not only makes life easier but also very fast. The world without digital technologies realization seems to be very hard. These activities involve the exchange of some messages, which sometimes needs security. Security in terms of confidentiality, integrity, availability. Objective: To develop an algorithm which can withstand against the snooping attack and traffic analysis. Method: DNA concept is used to perform the encryption process. After the encryption process has been performed, the resultant cipher text obtained can be made hidden into some of the randomly selected frames of video acting as a cover medium. The chaotic sequence has been used to select the random framed of carrier video. Results: Performance of proposed approach was evaluated on the different parameters and found satisfactory. Results obtained through histogram analysis clearly reflect observations that visual detection is very hard to observe. If spectral analysis is performed on the output generated by the encryption procedure of the proposed algorithm, the result will be encrypted message. Conclusion: Encrypting the required plain text, choosing a random frame and then hiding encrypted text in LSB of the chosen frame is the key concept of the proposed algorithm. The strength of DNA and Chaotic sequence is exploited in the proposed algorithm. Based on the survey and results obtained claim the strength of the proposed algorithm.

An Energy Efficient Clustering Algorithm for Network Lifetime in Wireless Sensor Network

In wireless sensor networks, information aggregation accept a fundamental part in lessening essentialness use. Starting late, investigate has focused on secure information aggregation due to the open and disagreeable condition passed on. The Homomorphic Encryption (HE) contrive is generally used to secure information grouping. In any case, HE-based information aggregation designs have the going with disservices: adaptability, unapproved aggregation, and obliged aggregation limits. To deal with these issues, we propose a safe information aggregation plot by solidifying homomorphic encryption development with a check plan. To answer this issue we exhibited a system addresses a procedure in that intense cluster head is picked based on the partition from the base station and remaining imperativeness. Consequent to picking the cluster head, it impacts use of minor measure of essentialness of sensor to organize and what's more improves the lifetime of the system of sensor arrange. Aggregation of the information got from the cluster people is commitment of cluster head in the cluster. Affirmation of information is done by the cluster head going before the information aggregation if information got isn't honest to goodness by then got information is discarded. Simply affirmed information is taken for aggregation at cluster head. Encryption is done by making use of homomorphic encryption procedure and also encoded information send to the cluster head and information disentangling is performed by base station (BS) for offering end to end security. An ID based stamp system is made for hop by hop authentication. In this paper, we demonstrate the method for recovering the information which is lost in light of the pad surge. In given system cache memory is given by the cluster head to recovery of information mishap. At long last test comes to fruition indicates depending upon parameter like time and furthermore essentialness usage on Jung test system that system showed is incredible appeared differently in relation to the open system.

Investigation on Image Encryption Using Chaos Based Techniques

As the trading of information over the open systems and internet is quickly developing, security of the information turns into a major concern. One conceivable answer for this issue is to encode the information. Chaos has been generally utilized for image encryption for its diverse elements. There are numerous chaotic based encryption procedures for information concealing like validation, hashing, cryptography have been created and are in practice nowadays. This paper moreover investigates the properties of various mapping techniques that stretches out to the execution parameters utilized as a part of encryption forms. Every one of the strategies checked on appeared inside the most recent years and are observed to be valuable for the present day encryption applications. Every system is one of a kind in its own specific manner, which may be reasonable for various applications. Over the long haul, new encryption strategies are advancing. Hence, quick and secure traditional encryption systems will be required in applications requiring high rate of security.

Medical Image Encryption Based on 2D Zigzag Confusion and Dynamic Diffusion

For the security of medical image, a new algorithm of medical image encryption is designed. The novel algorithm is based on a chaotic system composed of the two-dimensional Sine Logistic modulation map (2D-SLMM) and the two-dimensional Hénon-Sine map (2D-HSM). The main encryption procedure includes zigzag scan scramble, pixel grey value transformation, and dynamic diffusion. On the pixel grey value transformation stage, a password feedback is added. This makes the relationship between password and key more complicated. The proposed scheme is lossless for medical image encryption and decryption. It avoids the problems of low-dimensional chaotic map such as narrow interval and few parameters, as well as the problem of the special texture and contour of medical images. The key space of the novel algorithm is big enough, and the encryption and decryption processing are sensitive to the key. Simulation and experiments validate the effectiveness and efficiency of the novel algorithm. Security analysis proves the algorithm is resistant to common attacks.

Efficiency of Using the Diffie-Hellman Key in Cryptography for Internet Security

The businesses generate an “intranet” to hang about connected to the internet but secured from possible threats. Data integrity is quite a issue in security and to preserve that integrity we tends to develop as to provides the better encryption processes for security. In this work we will make a encryption harder with enhanced public key encryption protocol for the security and we will talk about the applications for proposed work. We will enhance the hardness in security by humanizing the Diffie-Hellman encryption algorithm by making changes or adding some more security codes in up to date algorithm. Network security has become more important to not public computer users, organizations, and the military.With the start of the internet, security became a major disquiet and the history of security allows a better understanding of the emergence of security technology. The internet structure itself allowed for many security threats to occur.When the architecture of the internet is modified it can decrease the possible attacks that can be sent across the network. Knowing the attack methods, allows for the suitable security to appear. By means of the firewalls and encryption mechanisms many businesses protected themselves from the internet.The firms crank out an “internet" to hold around connected into this world wide web but procured from potential dangers. Data ethics is a significant dilemma in protection and also to conserve integrity we all are inclined to grow concerning furnishes exactly the encryption procedures such as the security. Inside this job we'll earn a encryption tougher using improved general security protocol to your own stability and we're going to discuss the software for projected work. We'll improve the hardness of stability by humanizing that the Diffie Hellman encryption algorithm by generating alterations or including a few far more stability codes up to date algorithm. Network safety has gotten more very important to perhaps not people users, associations, and also the army. With all the beginning of internet, stability turned into a significant vexation along with the foundation of safety makes it possible for a superior comprehension of the development of technology. Even the online arrangement itself enabled for most security dangers that occurs. After the structure of this world wide web is altered it could diminish the probable strikes which may be transmitted from the other side of the community. Recognizing the assault procedures, permits the acceptable stability to arise. With this firewalls and security mechanics many companies shielded themselves out of the world wide web.

A chaotic framework and its application in image encryption

A novel image encryption framework is proposed in this article. A new chaotic map and a pseudorandom bit generator are proposed. Apart from this, a novel image encryption system is designed based on the proposed map and the proposed pseudorandom bit generator. These three are the major contributions of this work that makes a complete cryptosystem. The proposed new chaotic map is proposed which will be known as the ‘RCM map’ and its chaotic property is studied based on Devaney’s theory. The proposed pseudorandom bit generator is tested using the NIST test suite. The proposed method is simple to implement and does not involve any highly complex operations. Moreover, the proposed method is completely lossless, and therefore cent percent of data can be recovered from the encrypted image. The decryption process is also simple to implement i.e. just reverse of the encryption procedure. A scrambling algorithm is also proposed to further enhance the security of the overall system. The simulation, detailed analysis, and comparative studies of the proposed overall image encryption framework will help to understand the strengths and weaknesses of it. The experimental results are very promising and show the prospects of chaos theory and its usage in the field of data security.

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

New security approach-based Steganography and Cryptography by modified AES algorithm

The transmission of information through any channel of correspondence needs solid encryption procedures with the end goal of information security. The computerized watermarking assumes a significant part in inserting data into an advanced picture signal, for the check and character of its proprietors. In discrete wavelet change, "investigation channel bank" can be utilized for dissecting picture signals by going through. The channel bank comprises high and low pass channels at every deterioration stage. In this paper, a technique to consolidate steganography (Least Significant Method-LSM) and cryptography Advanced Encryption Standard (AES) is thought to give a safer method to information transmission through any unstable or public organizations. Prior to inserting the content in the picture, the text is scrambled utilizing AES calculation. Utilizing least significant bit (LSB) strategy, encoded the text installed in low-low (LL) subband wavelet decayed of a picture. Converse wavelet changes applied will lead to the output picture is communicated to the recipient. Presently at the collector's end, the picture changed utilizing wavelet and encoded text will be extricated by utilizing the LSB technique. This paper shows how AES calculation is utilized in the decoding of the outcome.