Block Encryption Algorithm Research Articles

Construction and Analysis of Models of Increasing Reliability for Modular Encryption Algorithm

This paper describes the development of a model of symmetric block encryption algorithm using nonpositional polynomial notation systems. Computer model this algorithm was created and its properties were investigated. In order to increase the cryptostrength of the algorithm simple substitution and gamming cipher modes were used, methods of the application of these modes are shown. As a continuation of this work, a computer model for managing keys in the encryption algorithm is being developed

An image block encryption algorithm based on hyperchaotic system and DNA encoding

An image block encryption algorithm based on hyperchaotic system and DNA encoding

Construction and Optimization of TRNG Based Substitution Boxes for Block Encryption Algorithms

Internet of Things is an ecosystem of interconnected devices that are accessible through the internet. The recent research focuses on adding more smartness and intelligence to these edge devices. This makes them susceptible to various kinds of security threats. These edge devices rely on cryptographic techniques to encrypt the pre-processed data collected from the sensors deployed in the field. In this regard, block cipher has been one of the most reliable options through which data security is accomplished. The strength of block encryption algorithms against different attacks is dependent on its nonlinear primitive which is called Substitution Boxes. For the design of S-boxes mainly algebraic and chaos-based techniques are used but researchers also found various weaknesses in these techniques. On the other side, literature endorse the true random numbers for information security due to the reason that, true random numbers are purely non-deterministic. In this paper firstly a natural dynamical phenomenon is utilized for the generation of true random numbers based S-boxes. Secondly, a systematic literature review was conducted to know which metaheuristic optimization technique is highly adopted in the current decade for the optimization of S-boxes. Based on the outcome of Systematic Literature Review (SLR), genetic algorithm is chosen for the optimization of s-boxes. The results of our method validate that the proposed dynamic S-boxes are effective for the block ciphers. Moreover, our results showed that the proposed substitution boxes achieve better cryptographic strength as compared with state-of-the-art techniques.

CF блокты шифрлау алгоритмi және оны биттiк шашырау эффектiне зерттеу

The article is about the importance, features and scope of symmetric block ciphers used to ensure theconfidentiality of data in the era of rapid development of modern computing technologies. In this paper, the structure ofthe symmetric block encryption algorithm CF, developed in the "Laboratory of Information Security" of the "Institute ofInformation and Computational Technologies", the round keys generating mechanism based on it’s secret key are described. A computer program of the created encryption algorithm was developed, on the basis of which the performance was studiedand the bit scattering between the plaintext and the ciphertext (the property of the "avalanche effect" and "strong avalancheeffect") was checked. In order to optimize the hardware implementation of the algorithm, the conversion of the S-block,which is considered as a nonlinear node, was obtained in 4x4 bit size.

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

The article describes an autonomous group of robotic systems forming a distributed data storage system. The destructive influences of an attacker in an autonomous group of robotic systems are intended to violate the qualitative characteristics of information that determine its suitability for its further purpose. One of the key requirements that determine the effectiveness of the functioning of the robotic system autonomous group is to ensure the confidentiality, integrity and availability of information at a level that allows the goal of the system to be fulfilled with a given quality, regardless of destructive influences. It is believed that the confidentiality of information in such systems is ensured by standard means of cryptographic information protection. At the same time, the integrity of information is limited only by control methods (hash functions) at the level of an individual robotic device and does not solve this problem for the group as a whole. As a result, it becomes necessary to form an «active» property of overcoming the consequences of harmful factors, an information survivability. It is proposed for such operating conditions in order to ensure the information survivability of an autonomous group of robotic complexes, the task of ensuring the integrity and, as a consequence of the availability of information, to be carried out as follows: the totality of storage devices located on board various robotic means should be considered as a single memory system with a cryptocode information protection subsystem. The subsystem of cryptocode information protection is based on the aggregated application of block encryption algorithms and codes based on interpolation procedures in Galois fields. The combination of various methods of secure data processing within the framework of a single memory system of an autonomous group of robotic systems ensures the integrity of information and, as a result, accessibility in conditions of physical loss of a certain established maximum number of complexes.

Visual Protection Using RC5 Selective Encryption in Telemedicine

The dissemination of the COVID-19 viruses now extends the usage of video consultations to share perspectives and virtual medical consultations, save expenses and health procedures, track the success of care proposals with detail, consistency, and ease from moment to time. The research aims to study the security of video consultations. We will also present the advantages and disadvantages of video consultations and the complications of their implementation. This paper mainly proposes a practical, high-efficiency video encoding technique for the new video encoding technique (HEVC) used in video consultations. The technology offered uses the RC5 block encryption algorithm for encrypting the sensitive bits of HEVC with low complexity, short encoding times in real-time implementations, format-compliant HEVC, and constant bitrate. In addition, this paper presents experimental results comparing the proposed HEVC RC5-based selective encryption (SE) algorithm with the other algorithms used in various operating modes using the Advanced Encryption Standard (AES). Also, this paper provides the security analysis of the proposed HEVC RC5-based SE algorithm for video consultation, including; the correlation analysis between the ciphered video and the original one, the histogram of the ciphered video, and the cipher cycle analysis. The security analysis results ensured that the proposed HEVC RC5-based SE algorithm for video consultation is safe and stable.

An Enhanced Block Pre-processing of PRESENT Algorithm for Fingerprint Template Encryption in the Internet of Things Environment

Many previous studies had proven that The PRESENT algorithm is ultra-lightweight encryption. Therefore, it is suitable for use in an IoT environment. However, the main problem with block encryption algorithms like PRESENT is that it causes attackers to break the encryption key. In the context of a fingerprint template, it contains a header and many zero blocks that lead to a pattern and make it easier for attackers to obtain an encryption key. Thus, this research proposed header and zero blocks bypass method during the block pre-processing to overcome this problem. First, the original PRESENT algorithm was enhanced by incorporating the block pre-processing phase. Then, the algorithm’s performance was tested using three measures: time, memory usage, and CPU usage for encrypting and decrypting fingerprint templates. This study demonstrated that the proposed method encrypted and decrypted the fingerprint templates faster with the same CPU usage of the original algorithm but consumed higher memory. Thus, it has the potential to be used in IoT environments for security.

Requirements for symmetric block encryption algorithms developed for software and hardware implementation

The hardware and software cryptographic information protection facility is one of the most important components of comprehensive information security in information and communication systems and computer networks. This article outlines and systematizes the basic requirements for modern cryptographic information protection facilities (CIPFs), and describes the stages of developing a symmetric block encryption algorithm. Based on the basic requirements for CIPFs, criteria for evaluating the developed cryptographic encryption algorithms were determined. The possibilities and necessary limitations of the types of cryptographic transformations (primitives) in the software and hardware implementation of the developed symmetric block encryption algorithm are considered and defined. On the basis of the developed encryption algorithm, SDTB Granit plans to implement a model of a hardware-software complex for off-line (linear) data encryption, taking into account all the listed requirements and characteristics. The article presents a new version of the "AL01" encryption algorithm, which is guided by the basic requirements for creating symmetric block ciphers.

Application three-valued logic in symmetric block encryption algorithms

The issues of limiting the use of binary logic for the further development of science engineering are discussed. The effectiveness of the use of the ternary number system at this stage in the development of information technologies is substantiated and shown. A method is proposed for increasing the informational entropy of plaintext by adding random data using ternary logic in the process of symmetric encryption. To reliably hide the added random data, the first transforming function is proposed to choose gamming with a key.

An Enhanced Hybrid Watermarking Method and Imaging System for Securing Medical Images

Medical image processing typically deals with the exploration of several medical image datasets for attaining an effective solution in diagnosing the affected patients. Medical image of the patients are typically stored in digital form as Electronic patient’s record (EPR), which must be dealt with utmost security and confidentiality, as the patient’s data are linked with external open platforms for future diagnosis. Medical image watermarking and encryption schemes assist in meeting the above requirements in effectively securing the patient’s image data. The ultimate objective of this research inclines towards securing medical images so as to achieve maximum effectiveness over health related areas. In this paper, an enhanced hybrid medical image watermarking and equivalent encryption strategy is typically investigated for attaining an effective solution towards medical image processing. The proposed methodology works with the integration of image watermarking algorithm together with an encryption algorithm. Image watermarking is achieved by a system based on Redundant discrete wavelet transform and Singular value decomposition. Moreover, by utilizing the property of chaotic signals for improving the integrity, a hybrid medical image watermarking technique is proposed by upgrading the Arnold cat map (ACM) with Logistic map. For image encryption, Symmetric block encryption algorithm based on Feistel structure is proposed. The efficiency of the proposed strategy is estimated in terms of Peak signal to noise ratio (PSNR), Mean square error (MSE) and Correlation coefficient (CC).

Neural-mechanism-driven image block encryption algorithm incorporating a hyperchaotic system and cloud model

An image encryption algorithm is proposed in this paper based on a new four-dimensional hyperchaotic system, a neural mechanism, a Galois field and an improved Feistel block structure, which improves the efficiency and enhances the security of the encryption algorithm. Firstly, a four-dimensional hyperchaotic system with a large key space and chaotic dynamics performance is proposed and combined with a cloud model, in which a more complex and random sequence is constructed as the key stream, and the problem of chaotic periodicity is solved. Then, the key stream is combined with the neural mechanism, Galois field and improved Feistel block structure to scramble and diffuse the image encryption. Finally, the experimental results and security analysis show that the encryption algorithm has a good encryption effect and high encryption efficiency, is secure, and can meet the requirements of practical applications.

ANALYSIS AND SOFTWARE IMPLEMENTATION OF MODULAR MULTIPLICATION-BASED BLOCK CIPHER

This article highlights the ever-increasing need and importance of information protection and data safety in modern reality, presents the possibilities of encrypting data using the tools of cryptography, particularly concentrating on the Modular Multiplication-based Block Cipher. Review of available sources indicated that there are no publically accessible software implementations of the algorithm available at the moment of writing this article. To achieve a goal of creating such an implementation, information has been compiled for creating a comprehensible and adequate mathematical description of the algorithm. Presented the information security system, an application in C # to encrypt files of any extension using the block encryption algorithm MMB

A block cipher algorithm developed using Magic Square in the seventh Order

This paper use the magic square of order 7 to develop Block encryption algorithms that work for encoding color images and text in GF(P) and GF(28). The algorithm use key with length = 35 and a message with length =14 are used, First, the keys are placed in the previously agreed positions and the remaining positions remain for the message, then the magic sum for each of them is calculated. Complexity, velocity, NIST calculations, and histogram calculations were calculated and the results were compared with the 5th degree magic square, where the complexity was with using GF(P) = (256)14 × (P)35 and using GF(28) = (256)14 × (256)35, The magic square of the seventh degree is better than the magic square of the fifth degree in cryptography in terms of complexity and a slight difference in speed.

A Novel Lightweight Block Encryption Algorithm Based on Combined Chaotic S-Box

Due to high computational cost, traditional encryption algorithms are not suitable for the environments in which resources are limited. In view of the above problem, we first propose a combined chaotic map to increase the chaotic interval and Lyapunov exponent of the existing one-dimensional chaotic maps. Then, an S-box based on the proposed combined chaotic map is constructed. The performances of the designed S-box, such as bijection, nonlinearity, strict avalanche criteria, differential uniformity, the bits independence criterion, and the linear approximation probability, are tested to show that it has better cryptographic performances. Finally, we present a lightweight block encryption algorithm by using the above S-box. The algorithm is based on the generalized Feistel structure and SPN structure. In addtion, the processes of encryption and decryption of our algorithm are almost the same, which reduces the complexity of algorithm implementation. The experimental results show that the proposed encryption algorithm meets the requirements of lightweight algorithms and has good cryptographic characteristics.

An Illustrative Study of Vehicle Ad-Hoc Network Security using Advanced Encryption Standard Algorithm

India accounts for the highest road accidents and traffic congestion globally. The necessity for a canny vehicle framework is of great importance. VANET, abbreviated as Vehicular ad hoc networks is a network created in an ad hoc manner where different vehicles can exchange useful information among each other with dedicated servers ensuring safe travel. Security in VANET has always been a challenge in implementing a real time intelligent transport system. VANET is a type of mobile ad-hoc, to give correspondences among close by vehicles and among vehicles and close by fixed hardware. Vehicular ad hoc networks are highly dynamic in nature and suffer from frequent path breakage due to the high velocity of the moving vehicle. Hence, there are many security challenges and different types of attacks that makes VANETs less secure. Therefore, providing secure dedicated short-range communication (DSRC) easefully with any loss of data or malicious nodes has been a major research area. The major concern being addressed in the paper is to provide secure communication and save lives in road accidents. The role of security is high and messages in DSRC send warning messages to other vehicles. If attackers change these messages, then accidents become a part of the network and users’ lives can be at risk. Different classes of attacks include monitoring attack, social attack, timing attack, application attack and network attack to name a few. Advanced encryption standard is a symmetric block encryption algorithm. There is no evidence to crack this algorithm till date. This paper will provide a detailed overview of VANET architecture, types of attacks on VANET, AES algorithm and its salient features and how this algorithm could be utilized to make intelligent transport systems secure.

Accounting Data Encryption Processing Based on Data Encryption Standard Algorithm

With the application of computer and network technology in the field of accounting, the development of accounting informationization is an inevitable trend, and the construction of accounting statement data into the data warehouse will be the basis of intelligent decision-making. The complexity of industry accounting statements and the arbitrariness and diversity of users’ needs for obtaining information using statements limit the development, popularization, and application of industry accounting statements. As a block encryption algorithm, the Data Encryption Standard (DES) algorithm uses 64-bit packet data for encryption and decryption. Each eighth bit of the key is used as a parity bit; that is, the actual key length is 56 bits. Encryption and decryption use the same algorithm structure, but the order in which the subkeys are used is reversed. Under the control of the subkey, inputting 64-bit plaintext can produce 64-bit ciphertext output; otherwise, inputting 64-bit ciphertext can produce 64-bit plaintext output. The confidentiality of the DES algorithm depends on the key, and only a very small number of keys are considered weak keys, which can be easily avoided in practical applications. The 3DES algorithm is a cascade of the DES algorithm, and its encryption process is based on the DES algorithm principle. This article explains the encryption process of the DES algorithm and introduces the composition of the 3DES algorithm. The experimental results show that the 3DES encryption algorithm still has a better encryption effect and “avalanche effect” than before the improvement. In addition, for the 3DES algorithm, its encryption efficiency has not been greatly affected. The 3DES encryption algorithm achieves one encryption process at a time to some extent, can effectively resist exhaustive search attacks, and enhance the security of the DES algorithm.

A Study of Sample Preprocessing Method for Correlation Power Analysis (CPA) Attack

To protect data, smartphones, PCs, networks, and other computer devices utilize block encryption algorithms, among which Advanced Encryption Standard (AES) is a representative encryption algorithm. AES is evaluated to be the safest one of the encryption algorithms at present and is universally applied. However, the AES encryption algorithm began to be threatened by Side-Channel Attack (SCA) since 1996. Many studies have been done and many more will probably be conducted, but so far, the results are showing some significant correlation between a variety of leaked information and success rate in side-channel attacks. Many different side-channel attacks are using a variety of leaked information (e.g., power consumption, electromagnetic waves, fault-injection results), among which Correlation Power Analysis (CPA) is the technique of analyzing power consumption with the Pearson correlation coefficient and it can be presenting a high success rate of attacking most hardware devices. If the correlation power analysis is applied and measured by an oscilloscope, it is possible to obtain secret keys of the low-power computer-based equipment, such as IoT or wearable devices. Also, recently, deep learning-based analytic studies on side-channel attacks are actively conducted, therefore, the need for research on attack methods and defense techniques becomes more urgent. In this paper, we upload AES’s AddRoundKey function to Arduino UNO, which has the capability that can be used for IoT, measure power consumption with an oscilloscope for all keys, check the correlation power analysis success rate, and confirm the need for defense techniques. For the experiment, based on the AddRoundKey function of AES, 256 secret keys were measured with a 1GS/S oscilloscope. At this time, these secret keys were bundled in tens per case, and therefore a total of ten cases were measured. In the comparison of power consumption, the Pearson correlation coefficient, and guess the key, correlations with secret keys were inferred. According to the simple comparison of power consumption and the Pearson correlation coefficient, the accuracy rate was about 65%. In this case, when the Pearson correlation coefficient was compared for the position of the power consumption waveform, the accuracy rate was about 80%. Additionally, with the use of the point that the positions of guess keys were mostly constant, it was possible to achieve the success rate of about 93.75%.

Approaches to the application of homomorphic encryption in sensor networks

This paper describes the basic principles of the sensor network. The article characterizes the most common types of attacks on wireless sensor networks. The most commonly used protocols of sensor networks are presented. Special attention is paid to schemes of partially homomorphic encryption and fully homomorphic encryption schemes. An approach to the implementation of sensor network protection using the joint use of a fully homomorphic encryption algorithm and a symmetric block encryption algorithm is proposed.

A Secure Chaotic Block Image Encryption Algorithm Using Generative Adversarial Networks and DNA Sequence Coding

This paper proposes a block encryption algorithm based on a new chaotic system that combines generative adversarial networks (GANs) and DNA sequence coding. First, the new one-dimensional chaotic system that combines GANs with DNA sequence coding generates two more complex key stream sequences. Then, the two different random sequences are combined with an improved Feistel network by utilizing the product of the block matrix to encrypt the image to scramble and diffuse the image. Finally, the security performance of this algorithm is quantitatively analysed. The simulation results show that the proposed chaotic system has a large key space, and the new algorithm yields adequate security and can resist exhaustive attacks and chosen-plaintext attacks. Therefore, this approach provides a new algorithm for secure transmission and protection of image information.

A new approach to design S-box generation algorithm based on genetic algorithm

Substitution box (S-box) is one of the most important structures used for byte change operation in block encryption algorithms. An S-box structure with strong cryptological properties makes the enc...