Simulation-driven assessment of cryptographic algorithms for resource-constrained infocommunication networks

Ensuring data security is an essential priority to be put forward once there will be a digital transmission between any two or more targeted audience. Hence, the objective of this paper was to propose a better data security model for a protective information exchange on the internet with steganographic and cryptographic algorithms. Three cryptographic symmetric key encryption algorithm (RC6, Rijndael and TwoFish) and four steganographic carrier object (Image, audio, text and video) were considered. Data obtained show that Rijndael (AES) takes less encipherment and decipherment time compare to RC6 and TwoFish in cryptographic symmetric key encryption algorithm, while image carrier achieves better Peak-Signal-to-Noise Ratio if related to audio, video and text steganography. This research suggests the use of Advanced Encryption Standard and image steganography for efficient information interchange on the internet.

Block symmetric cryptographic algorithms are the essential and inalienable element of any information security system. The main component of block symmetric cryptographic algorithms is the S-box, which largely determines the speed and cryptographic quality of the entire cryptographic transformation. The rapid development of cryptanalysis methods, including the development of quantum computers, requires a more careful research of all possible representations of nonlinear elements of block symmetric cryptographic algorithms. In view of the fact that in addition to the mathematical apparatus of Boolean functions used today to estimate the cryptographic quality of S-boxes, a cryptanalyst can apply the mathematical apparatus of functions of many-valued logic, which makes relevant the task of researching and comparing the cryptographic quality of S-boxes of modern cryptographic algorithms, represented by functions of many-valued logic. This paper presents a research and comparative analysis of nonlinear transformations of the cryptographic algorithms AES, Kalyna, BelT, and Kuznechik when represented by functions of many-valued logic. It was found that only the nonlinear transformation of the BelT cryptographic algorithm is characterized by growth when represented by many-valued logic functions, while the Kalyna cryptographic algorithm demonstrates the greatest decrease in nonlinearity when represented by 16-functions among the cryptographic algorithms researched. The results obtained in the paper indicate a significant unused reserve of cryptographic quality, which can be used in the design of new cryptographic algorithms and their structural elements.

In this work, possible optimization techniques for realization of asymmetrical and symmetrical standard cryptographic algorithms on assembler of Texas Instruments TMS320C54x family of digital signal processors are considered. Optimization of RSA asymmetrical, as well as IDEA and AES (Rijndael) symmetrical algorithms are evaluated. Possible optimization techniques for RSA algorithm are related to multiplication, modular reduction and RSA private key operation procedures. We have modified the original Karatsuba-Offman’s algorithm and obtain a less recursive algorithm and use it for possible optimization. A cryptographic throughput and a speed of the signal processor’s realization of IDEA and AES symmetrical algorithms in ECB mode are also analyzed. Besides, an optimization procedure in AES algorithm using specific tables is also discussed. Obtained results show that the TMS320C54x family of signal processors is suitable for the standard asymmetrical and symmetrical algorithms’ realization.

Data security is very important as it is easy to exchange data today.
 Cryptographic techniques are needed as data security techniques. Combining two cryptographic algorithms is a solution for a better level of security. The Advanced Encryption Standard (AES) cryptographic algorithm requires low computational power and is the best symmetric algorithm. The LUC algorithm is an asymmetric algorithm that was developed from the RSA algorithm and has advantages in a better level of security and processing speed. In this research, two symmetric and asymmetric cryptographic algorithms will be combined in a hybrid scheme, namely the AES and LUC algorithms to improve data security. the AES algorithm will encrypt and decrypt messages, while the LUC algorithm performs encryption and decryption of the AES key. The results showed that the combination of the two AES and LUC algorithms was successful. However, the computational time needed by the two algorithms to perform the encryption and decryption process increases. The simulation results of the brute force attack performed show that the LUC algorithm can still be attacked. The greater the value of E (the public key of the LUC algorithm), the longer it takes for the brute force attack to be successful. The value of E is also directly proportional to the computational time required by the LUC. So it can be concluded that the AES algorithm is less precise when combined with the LUC algorithm.

Data security is becoming one of the most significant challenges in the digital world. Retrieval of data by unauthorized parties will result in harm to the owner of the data. PDF data are also susceptible to data security disorder. These things affect the security of the information. To solve the security problem, it needs a method to maintain the protection of the data, such as cryptography. In cryptography, several algorithms can encode data, one of them is Two Square Cipher algorithm which is a symmetric algorithm. At this research, Two Square Cipher algorithm has already developed into a 16 x 16 key aims to enter the various plaintexts. However, for more enhancement security it will be combined with the VMPC algorithm which is a symmetric algorithm. The combination of the two algorithms is called with the super-encryption. At this point, the data already can be stored on a mobile phone allowing users to secure data flexibly and can be accessed anywhere. The application of PDF document security on this research built by Android-platform. At this study will also calculate the complexity of algorithms and process time. Based on the test results the complexity of the algorithm is θ (n) for Two Square Cipher and θ (n) for VMPC algorithm, so the complexity of the super-encryption is also θ (n). VMPC algorithm processing time results quicker than on Two Square Cipher. And the processing time is directly proportional to the length of the plaintext and passwords.

The problem of information security that circulates in communication channels is constantly being updated. It is especially acute for military VoIP telephony or dual use. This relates to the growth of the value of confidential information, which is of interest to cybercriminals, and with the increase in the technological complexity of cyberattacks at the same time as the productivity of technical means of obtaining unauthorized information increases. Cryptographic methods of information protection occupy one of the key places among the well-known mechanisms for ensuring the cyber security of speech information circulating in communication channels. SRTP security protocols, which implement the symmetric cryptographic encryption algorithm AES, are most often used to organize secure VoIP traffic. At the same time, the potential compromise of the best symmetric cryptographic algorithm AES-256 requires the search for new non-trivial approaches to improving cyber security mechanisms. One of these approaches developed in the article is an approach based on the use of the Fredholm cryptosystem model. The mentioned cryptographic system belongs to the class of symmetric cryptographic systems, but to date, due to the lack of scientifically based cryptographic algorithms, it has not yet gained practical implementation. To resolve this contradiction, the article, based on the principle of O. Kerckhoffs, developed a method of cryptographic protection of speech information based on differential transformations developed by Academician of the National Academy of Sciences of Ukraine H. Pukhov. The developed method makes it possible to obtain a cipher in the form of a differential spectrum, which is resistant to known methods of cryptanalysis. The article developed an algorithm for implementing the method. The results of encryption and decryption of speech information are given. The convergence of simulation results with other known methods confirms the workability of the developed method.

This paper aims to present the survey of cloud computing security. A cloud computing security is defined so that it can help to clarify cloud security. Cloud computing has evolved to become an essential component of both current and future information technologies. This technology was created to be used in conjunction with the internet, and it includes features such as data storage, remote access, and so on. Various cryptographic encryption algorithms are compared in terms of their various key features. The primary goal is to highlight such attacks and provide recommendations for resolving data breaching issues using cryptographic algorithms such as Symmetric Key Cryptographic Algorithms (DES, 3DES, AES), Asymmetric Key Cryptographic Algorithms (RSA, DSA, Diffie-Hellman Algorithm), and Hashing Algorithms (MD5, SHA). So, in the paper cloud security challenges and the cryptographic algorithms used to prevent them are discussed.

In the today world, security is required to transmit confidential information over the network Security is also demanding in wide range of applications.Cryptographic algorithms play a vital role in providing the data security against malicious attacks.But on the other hand, they consume significant amount of computing resources like CPU time, memory, encryption time etc.Normally, symmetric key algorithms (same key use For encryption and decryption) and asymmetric key algorithms (different key use for both encryption and decry piton) as they are very fast in nature.Symmetric algorithms are classified as block cipher (AES) and stream ciphers (RC4) algorithms.In this paper, we compare the AES (block cipher) algorithm with different modes of operation and RC4 (stream cipher) algorithm in terms of CPU time, encryption time, memory utilization and throughput at different settings like variable key size and variable data packet size and develop both block diagram.

The application of a multicriteria evaluation (MCE) approach to identify suitable areas for the production of banana, lichee and longyan in Southeast of Fujian Province in China is presented. Climate, terrain and soil databases were used to integrate GIS coverage. Because of the varied topography of Fujian province, the yearly average temperature and minimum temperature were modeled through DEM for the whole region. The evaluation factors of slope, aspect were derived from DEM through ARCGIS8.3 software. Relevant criteria for this fruit trees and suitability levels were defined. This information was used to obtain the criteria maps, which in turn were used as input into the MCE algorithm. Using weighted linear combination with the GIS data layers, a certain suitability map could be produced. Landsat TM images in the autumn of 1998 were processed using ERDAS Image8.5 software by means of a supervised classification to obtain a land use/cover map. These land use/cover and the suitability maps were crossing to identify differences and similarities between the present land use and the suitable areas for banana, lichee and longyan.

Cryptography is a science that studies methods so that data or messages remain safe when sent, from the sender to the recipient without experiencing interference from unauthorized parties. The cryptographic system used is a combination of symmetrical cryptographic algorithms, and asymmetric cryptographic algorithms also called hybrid cryptosystems. This research work tries to explore the need of integration of different encryption algorithms and enhance the strength of encryption and complexity. This work observes that integrity check algorithm can also be used to generate key of asymmetric key cryptography and they can help to enhance power of confidentiality. In this paper, we present a new hybrid by using Blowfish, RC6 and RSA algorithms. Within this, the data is encrypted through symmetric algorithm using RC6 and blowfish algorithm and key is encrypted using an asymmetric algorithm called RSA. The complete solution was implemented using Java technology and it was evaluated based on computation time.

In the network security system cryptography plays a vital role for the secure transmission of information. Cryptography is a process of integrating and transferring the data to the genuine users against any attacks. There are two types of Cryptographic algorithm: Symmetric and Asymmetric algorithms. In the symmetric type cryptography, single key is used for both encryption and decryption. Symmetric algorithms are fast and simple. Asymmetric cryptographic algorithm uses different keys such as public key to encrypt the message at sender and private key which is known only to receiver for decrypting the encrypted message. Asymmetric algorithms are more secure and difficult, to decrypt the message unless hacker acquires the knowledge of private key. A new Asymmetric algorithm with Error Detection and Correction mechanism is proposed that can reduce hardware, and improves decryption time and security. Proposed Asymmetric algorithm uses the few properties of: RSA, Diffie-Hellman and ElGamal Algorithms. Performance of asymmetric algorithms is compared with proposed algorithm, which is designed using Verilog HDL. Algorithms are synthesized, simulated, implemented using Vivado and targeted for Artix-7 XC7A100T-1CSG324Carchitecture.Chipscope Pro logic analyzer-Virtual Input Output core is binded to design for hardware debugging, to monitor and capture the output signals at selected specified state by applying random input stimuli at runtime in Nexys4 DDR FPGA Board.

The main attributes of a security framework are Confidentiality, Authentication, and Data integrity. There are two main standards of cryptography algorithms categorized as private or symmetric and public or asymmetric algorithms, symmetric algorithms use one secret key to encrypt and decrypt payloads, the list includes Data Encryption Standard (DES), Advanced Encryption Standard (AES), RC5, Blowfish, and others, and asymmetric algorithms use key pairs consists of public and private keys, RSA, and Elliptic Curve Cryptography are two best examples of the same. In spite of their successful implementations, these standards suffer from various attacks, and the beginning of large-scale quantum is the biggest threat to the commonly used cryptography algorithms. In general, Public-key cryptography relies upon mathematical problems that are hard to be broken with the available computational power but it is believed that quantum computers can break them at polynomial solvable time in future. Quantum-safe cryptography refers to a new generation of algorithms that are resilient against attacks launched by both classical and quantum computers. This work designs and implements a novel cryptography standard using polynomial interpolations to make it both supercomputer and quantum safe.

The purpose of the article is an analytical review of the application of cellular automata and their generalizations in cryptography. Research method: an analysis of scientific publications on the topic of the article. Results: The review article analyzes the literature devoted to the use of cellular automata and their generalizations for the construction of cryptographic algorithms. The article consists of two parts. The first part was devoted to classical cellular automata and symmetric cryptographic algorithms based on them. It briefly discussed the history of the theory of cellular automata and its application in various scientific fields. A review of the works of a number of authors who proposed symmetric cryptographic algorithms and pseudorandom sequence generators based on one-dimensional cellular automata was presented. The security of such cryptographic algorithms turned out to be insufficient. The following was a review of articles devoted to the use of two-dimensional cellular automata for constructing ciphers (this approach gave the best results). Multidimensional cellular automata were also mentioned. This second part of the article is devoted to a review of works devoted to the use of generalized cellular automata in cryptography – on the basis of such automata, it is possible to create symmetric encryption algorithms and cryptographic hash functions that provide a high level of security and high performance in hardware implementation (for example, on FPGA), as well as having fairly low requirements for hardware resources. In addition, an attention is paid to interesting connections of generalized cellular automata, in the context of their use in cryptography, with the theory of expander graphs. Attention is also paid to the security of cryptographic algorithms based on generalized cellular automata. The works devoted to the implementation of various cryptographic algorithms based on generalized cellular automata on FPGA and GPU are mentioned. In addition, an overview of asymmetric cryptoalgorithms based on cellular automata is given. The questions about the belonging of some problems on cellular automata and their generalizations to the class of NP-complete problems, as well as to some other complexity classes, are also considered.

The purpose of the article is an analytical review of the application of cellular automata and their generalizations in cryptography. Research method: an analysis of scientific publications on the topic of the article. Results: The review article analyzes the literature devoted to the use of classical cellular automata and their generalizations for the construction of cryptographic algorithms. The article consists of two parts. The first part is devoted to classical cellular automata and symmetric cryptographic algorithms based on them. It briefly discusses the history of the theory of cellular automata and its applications in various scientific disciplines. The review of the works of a number of authors who proposed symmetric cryptographic algorithms and pseudorandom sequence generators based on one-dimensional cellular automata is presented. The security of such cryptographic algorithms turned out to be insufficient. The following is a review of articles devoted to the use of two-dimensional cellular automata for constructing ciphers (this approach gave the best results). Multidimensional cellular automata are also mentioned. The second part of the article will be devoted to a review of works devoted to the use of generalized cellular automata in cryptography – on the basis of such automata, it is possible to create symmetric encryption algorithms and cryptographic hash functions that provide a high level of security and high performance in hardware implementation (for example, on FPGA), as well as having fairly low requirements for hardware resources. In addition, an attention will be paid to interesting connections of generalized cellular automata, in the context of their use in cryptography, with the theory of expander graphs. Attention will also be paid to the security of cryptographic algorithms based on generalized cellular automata. The works devoted to the implementation of various cryptographic algorithms based on generalized cellular automata on FPGA and GPU will be mentioned. In addition, an overview of asymmetric cryptographic algorithms based on cellular automata will be given. The questions about the belonging of some problems on cellular automata and their generalizations to the class of NP-complete problems, as well as to some other complexity classes, will also be considered.

Wireless sensor networks consist of many inexpensive wireless nodes, each having sensing capability with some computational and communication power. Asymmetric cryptographic algorithms are not suitable for providing security on wireless sensor networks due to limited computation, power, and storage resources available on sensor nodes. Therefore, the energy-efficient security protocol proposed in this paper uses symmetric cryptographic algorithms to support security. To mitigate the drawbacks of symmetric cryptographic algorithms, the session key is changed dynamically, in addition to employing code-hopping technique in non-blocking OVSF codes.