Symmetric Cryptographic System Research Articles

Chaos CSPRNG Design As a Key in Symmetric Cryptography Using Logarithmic Functions

This research uses the logarithm function as a key component in generating random numbers in the Chaos CSPRNG framework. The main problem addressed here is the generation of keys for cryptography, recognizing the important role of cryptographic keys in safeguarding sensitive information. By using mathematical functions, specifically logarithmic functions, as a key generation method, this research explores the potential for increasing the uncertainty and strength of cryptographic keys. The proposed approach involves the systematic utilization of various mathematical functions to generate diverse and unpredictable data sets. This data set, derived from the application of logarithmic functions, serves as the basis for generating random numbers. Through a series of tests such as Randomness Test and Cryptography Test, this research shows that the data generated from these functions can be utilized effectively as a reliable source for generating random numbers, and has a low correlation value, thereby contributing to the overall security of a symmetric cryptographic system.

Approach to Constructing Symmetric Cryptographic Systems Ensuring Specified Resilience to Cryptoanalysis over the Long-Term Time Horizon

Abstract— The paper presents the results of an analysis of the decrease in cryptographic strength of the most common symmetric ciphers, taking into account the development of cryptanalytic methods. The vector of the threat to the reduction of information confidentiality stored and processed in information systems in the long term has been determined. An approach to constructing hybrid ciphers, based on the symbiosis of a composite cipher and the Vernam cipher, has been proposed to enhance the asymptotic cryptographic strength of symmetric cryptographic systems used for data encryption in information systems, the relevance of stored and processed information in which does not significantly decrease over time. For instance, this is applicable to information systems built on distributed ledger technology (blockchain networks).

An Algorithm for Constructing Support of Bent Functions by Extending a Set

Boolean functions form the fundamental components of symmetric cryptographic systems, serving as the building blocks. Modifying bent functions makes it feasible to design Boolean functions with desired properties that exhibit high non-linearity. The current study offers a comprehensive analysis of bent functions through its support, culminating in the introduction of an algorithm for the systematic construction of four variable bent functions. This algorithm enables the complete generation of all 896 four-variable bent functions. Furthermore, we introduce a methodology for constructing n-variable bent functions (where n > 4), leveraging both the algorithm and an established secondary technique for bent function construction. Lastly, we examine the estimation of the count of bent functions by utilising certain properties associated with the support of bent functions.

A Novel Image Encryption using Improved Chaotic Maps and Multiple Encryption Tables

This paper proposes a new symmetric cryptographic system using chaotic systems. The basic idea is that a random strand is generated from chaotic functions. The developed random strand is merged with the strand obtained from the original image. The researcher used tables called multiple encryption tables in the composition of these strands. These tables are produced according to a specific pattern. The strand combination algorithm randomly selects a table from a set of tables and performs the combination operation. This table will be replaced with another table under certain conditions. The diversity of tables and their dynamic selection in the integration operation will increase the resistance to attacks and threats and increase the proposed encryption system's efficiency. To prove the proposed system's efficiency, the obtained results have been evaluated by various tests such as entropy, correlation coefficient, and pixel change rate. Our results show that the proposed cryptographic system is cost-efficient, practical, and resistant, yet further research is required to make a final statement about its competence.

LK-AKA: A lightweight location key-based authentication and key agreement protocol for S2S communication

As a supplement to terrestrial networks, satellite communication networks have a lot of advantages, such as wide coverage, large communication capacity, reliable communication quality, and seamless global connectivity, which are highly competitive with traditional communication technologies. However, there are still many security issues and efficiency problems in satellite networks due to the characteristics of satellite communications, such as highly exposed satellite links, dynamical topology, and the limited computational power and storage resources of satellites. Therefore, it is a crucial issue to design a lightweight and secure authentication mechanism to ensure the security of satellite-to-satellite communication (S2S). This paper proposes a lightweight authentication and key agreement scheme for S2S communication based on the symmetric cryptographic system and the satellite location key (LK) constructed by satellite orbital parameters and location information. The formal verification tool Scyther is employed to evaluate the proposed scheme’s security. The security analysis results show that it has good performance in providing security properties and resistance to typical attacks, such as replay attacks, impersonation attacks, and Man-In-The-Middle (MITM) attacks. In addition, the performance analysis results demonstrate that our scheme has desired efficiency in terms of signaling overhead, computational overhead, and bandwidth overhead.

Protokoli za ustanovljavanje tajnih simetričnih ključeva - savremen pristup

Introduction/purpose: The problem of efficient distribution of cryptographic keys in communication systems has existed since its first days and is especially emphasized by the emergence of mass communication systems. Defining and implementing efficient protocols for symmetric cryptographic keys establishment in such circumstances is of great importance in raising information security in cyberspace. Methods: Using the methods of Information Theory and Secure Multiparty Computation, protocols for direct establishment of cryptographic keys between communication parties have been defined. Results: The paper defines two new approaches to the problem of establishing cryptographic keys. The novelty in the protocol defined in the security model based on information theory is based on the source of common randomness, which in this case is the EEG signal of each subject participating in the communication system. Experimental results show that the amount of information leaking to the attacker is close to zero. A novelty in the second case, which provides security with keys at the level of computer security by applying Secure Multiparty Computation, is in the new application field, namely generation and distribution of symmetric cryptographic keys. It is characteristic of both approaches that within the framework of formal theories, it is possible to draw conclusions about their security characteristics in a formal way. Conclusions: The paper describes two new approaches for establishing cryptographic keys in symmetric cryptographic systems with experimental results. The significance of the proposed solutions lies in the fact that they enable the establishment of secure communication between communication parties from end to end, avoiding the influence of a trusted third party. In that way, the achieved communication level security significantly increases in relation to classical cryptographic systems.

Quantum Key Distribution by Drone

A cryptographic communication system is secure from a practical point of view if the encryption scheme can be broken after X years, where X is determined by security needs and existing technology. Quantum cryptography does not offer a complete solution for all cryptographic problems: secure keys, encryption algorithms based on them, message authentication and finding ways to detect/prevent interception; but it can be seen as a complement to standard symmetric cryptographic systems. This paper presents the implementation of the BB84 quantum key distribution protocol on mobile systems - Amov-lab’s Z410 drone with T-engine 2216 - and tracks the error rate obtained in flight conditions.

Designing Substitution Box Based on the 1D Logistic Map Chaotic System

Many researchers have tried to use the chaotic systems in generating different cryptographic tools, in order to provide high level of security to the data passing through network. In modern symmetric cryptographic systems, one of the most essential functions is a nonlinear mapping Substitution process which is responsible for creating the confusion between plaintext and ciphertext. It replaces each input bits by other bits using the lookup table S-Box. In this paper a new S-Box based on a 1D logistic map chaotic system was designed. The chaotic sequence generated from the 1D logistic map was processed to generate the hexa code values, and after that this hexa code also processed to construct the new good S-Box. This proposal was evaluated using the S-Box tests criteria including avalanche, balanced, completeness, strict avalanche, and invertibility. The analysis results show that the proposed S-Box passes all these statistical tests, has large avalanche effect and therefore the S-Box can avoid many attacks. The construction of both Substitution-Box and its inverse take only few milliseconds, so it can be used in many lightweight block ciphers.

Galois Ring $$GR\left( {2^{3} ,8} \right)$$ Dependent $$24 \times 24$$ S-Box Design: An RGB Image Encryption Application

An S-box is based on Boolean functions which are essentially the foundation of symmetric cryptographic systems. The Boolean functions are used for S-box designing in block ciphers and exploited as nonlinear components. Boolean functions with optimal nonlinearity and upright cryptographic stuffs play a significant role in the design of block ciphers. Traditionally $$8 \times 8$$ S-box is a $$16 \times 16$$ look up table over Galois field $$GF\left( {2^{8} } \right)$$ and has 112 feasible upper bonds for nonlinearity. A $$24 \times 24$$ S-box over Galois field $$GF\left( {2^{24} } \right)$$ is not viable as the computer memory does not support it. In this paper for the construction of $$24 \times 24$$ S-box a rout is adopted via maximal cyclic subgroup of the multiplicative group of units of Galois ring $$GR\left( {2^{3} ,8} \right).$$ The newly constructed S-box has much higher confusion capability than any of $$8 \times 8$$ S-box. To judge the impact of this new $$24 \times 24$$ S-box an RGB color image encryption application is demonstrated. Initially, in the proposed encryption scheme we use $$24 \times 24$$ S-box for confusion in RGB channels of plain image, however for diffusion linear permutation $${\text{P}} = \left( {{\text{i}} \times 32} \right) {\text{mod}}257$$ is operated and then by the use of exclusive-or an encrypted image is obtained. Thus, we introduce a novel technique by which $$24$$ binary bits are divided into 3 bytes and each one deals R, G and B channel of the color image separately. A comparison with chaos and DNA based image encryption schemes shows the performance results of this novel RGB image encryption and observed as meeting the standard optimal level. Hence this $$24 \times 24$$ S-box dependent encryption method replaces $$8 \times 8$$ S-box based RGB color image encryption scheme.

ВЫЧИСЛЕНИЕ НА ЯЗЫКЕ C# СПЕЦИАЛЬНЫХ ФУНКЦИЙ ERF(X) И ERFC(X) ДЛЯ НУЖД КРИПТОГРАФИЧЕСКОГО АНАЛИЗА

A variant of computation in C# language such special features as a function of an error, an incomplete error function and the function of the normal distribution, commonly used in the performance of tasks related to the testing of symmetric cryptographic systems. This software module is the most compact of the created in Visual Studio.NET environment and can be used by developers of ciphers as part of their software.

Efficient and Secure Single Sign on Mechanism for Distributed Network

Distributed network is act as core part to access the various services which are available in the network. But the security related to distributed network is main concern. In this paper single sign-on SSO mechanism is introduced which gives access to all services by allowing to sign on only once by users. In this mechanism once user logs in to the Trusted Authority Center TAC then application or services which are register to trusted center will automatically verifies the user’s credentials details and these credentials like password or digital signature will be only one for all applications or services. Unlike all other previous mechanisms where in, if user wants to have access multiple services then for every service distinct user credentials (username, password) must be required. SSO act as single authentication window to user for admittance multiple service providers in networks. Previously introduced technique based SSO technology proved to be secure over well-designed SSO system, but fails to provide security during communication. So here emphasis is given on authentication as open problem and on to refining the already proposed SSO process. And to do this along with RSA algorithm which was used in previous SSO process, we will be using MAC algorithm, which is intended to provide secured pathway for communication over distributed network.TAC i.e. Trusted Authority Center is used for sending token integrated with private and shared public key to user. General Terms 1. Plaintext (Clear-text) The human readable message which will be converted into an human unreadable (meaningless) message. 2. Cipher-text It is a message in encrypted form. 3. Encryption It is the process which converts a plaintext message into a cipher text message. 4. Decryption It is the process which converts a cipher text message into a plaintext message. 5. Key An important factor (parameter) used in the encryption and decryption Process. 6. Cryptosystem It is a system to encrypt and decrypt information. 7. Symmetric Cryptosystem Symmetric cryptographic system uses the same key to encrypt and decrypt information. 8. Asymmetric Cryptosystem Asymmetric cryptographic system uses one key to encrypt and a different key to decrypt. 9. Cryptography The use of cryptographic systems is to maintain the confidentiality of information. 10. Crypto analysis It is the study of breaking cryptographic systems.

Construction of Network Security Architecture Based on Formal Specification in Digital Campus

With comprehensive analysis on security requirements of information transmission in digital campus, new primitives in asymmetric and symmetric cryptographic system are designed to describe essential security attributes. Secure information transmission is constructed with composition of the generated primitives and realized with common security technologies. And then, formal analysis shows that, secrecy, integrity, availability, controllability, non-repudiation and identifiability during information transmission can be insured by this architecture. At last, the network security architecture is verified by experiment based on Hadoop, with comparison data on the attacked rate in cloud environment.

Two-Key Dependent Permutation for Use in Symmetric Cryptographic System

This paper deals with a two-key based novel approach for generating a permutation table that can be used in a symmetric cryptographic system to cause diffusion. It also discusses how the permutation table generated using the approach can be applied to character based encryption and binary data block produced at intermediate stages by symmetric cipher algorithms. It also describes the effect of our approach on characters of intermediate text as well as on bits of binary data block along with the impact of a single bit change in key information on producing permutation sequences applied to plaintexts to produce ciphertexts. The results are satisfactory and the proposed approach can be employed in any symmetric block cipher algorithm that uses the predefined permutation tables.

Image encryption using Game of Life permutation and PWLCM chaotic system

This paper proposes a new chaotic symmetric cryptographic system. At first, we use the proposed method, Game of Life permutation which is the initial pattern generated by logistic map, to confuse the plain image. Secondly, we use piecewise linear chaotic map (PWLCM) to diffuse the image, which we just process the higher half pixel to improve the speed. It will not affect the encryption results at the same time, which is because the higher 4 bits (8th, 7th, 6th and 5th) carry almost all information of the image. Experiment results and security analysis not only show that the scheme can achieve good encryption result, but also that the key space is large enough to resist against common attack.