New combination of simple additive and entropy weighting criteria for the selection of best substitution box

2021 ◽  
pp. 1-14
Author(s):  
Majid Khan ◽  
Haj Ismail ◽  
Iqra Ishaque ◽  
A, Iqtadar Hussain

Substitution boxes (S-boxes) are among the most widely recognized and fundamental component of most modern block ciphers. This is on the grounds that they can give a cipher fortifying properties to oppose known and possible cryptanalytic assaults. We have suggested a novel tool to select nonlinear confusion component. This nonlinear confusion component added confusion capability which describes to make the connection among the key and the cipher as complex and engaging as possible. The confusion can be obtained by using substitution box (S-box) and complex scrambling algorithm that relies on key and the input (plaintext). Various statistical and cryptographic characteristics were introduced to measure the strength of substitution boxes (S-boxes). With the help of the present objective weight methods and ranking technique, we can select an ideal S-box among other constructed confusion component to make our encryption algorithm secure and robust against various cryptographic attacks.

Author(s):  
Showkat Ahmad Bhat ◽  
Amandeep Singh

Background & Objective: Digital multimedia exchange between different mobile communication devices has increased rapidly with the invention of the high-speed data services like LTE-A, LTE, and WiMAX. However, there are always certain security risks associated with the use of wireless communication technologies. Methods: To protect the digital images against cryptographic attacks different image encryption algorithms are being employed in the wireless communication networks. These algorithms use comparatively less key spaces and accordingly offer inadequate security. The proposed algorithm described in this paper based on Rubik’s cube principle because of its high confusion and diffusion properties, Arnold function having effective scrambling power, blocking cipher with block encryption and permutation powers. The main strength of the proposed algorithm lies in the large key spaces and the combination of different high power encryption techniques at each stage of algorithm. The different operations employed on the image are with four security keys of different key spaces at multiple stages of the algorithm. Results & Conclusion: Finally, the effectiveness and the security analysis results shows that the proposed image encryption algorithm attains high encryption and security capabilities along with high resistance against cryptanalytic attacks, differential attacks and statistical attacks.


2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Yue Leng ◽  
Jinyang Chen ◽  
Tao Xie

Permutations with low differential uniformity, high algebraic degree, and high nonlinearity over F22k can be used as the substitution boxes for many block ciphers. In this paper, several classes of low differential uniformity permutations are constructed based on the method of choosing two permutations over F22k to get the desired permutations. The resulted low differential uniformity permutations have high algebraic degrees and nonlinearities simultaneously, which provide more choices for the substitution boxes. Moreover, some numerical examples are provided to show the efficacy of the theoretical results.


Author(s):  
Robert A. White ◽  
David P. Blanchard

At the Palisades Nuclear Power Plant, a review of systems, structures and components is being performed for a variety of risk-informed applications. Among these applications is the In-Service Testing program developed under Section XI of the ASME Boiler and Pressure Vessel Code. In reviewing the scope of the IST program, a relatively new risk ranking technique is being utilized called Top Event Prevention (TEP). TEP differs from more traditional methods of risk ranking in that it uses defense-in-depth methods to select what SSCs are important to safety. The results of the TEP analysis are also somewhat unique as compared to more traditional approaches in that combinations of equipment important to safety are identified as opposed to determining importance one component at a time. In addition, entire paths or trains of equipment are identified as being required to manage safety. Furthermore, the components identified in the selected trains are minimal. That is, TEP identifies the minimum set of equipment modeled in the PRA that is necessary to manage safety. Because TEP provides a structured, deterministic approach to selection of components that are important to managing safety, consideration is being given to classifying pumps and valves into one of three safety categories; high safety significant components, low safety significant components and a third non safety significant category. The first two categories of safety significance are similar to those already defined in Regulatory Guide 1.175 [1], and will identify where current testing methods remain appropriate while suggesting those components for which testing intervals can be extended. The third or non-safety significant category has been established to identify those pumps and valves to which the PRA and safety are insensitive. Preliminary results from the TEP analysis of the Palisades IST scope suggest that of the more than 500 pumps and valves modeled in the PRA, just under one third are not important from a defense-in-depth perspective. Probabilistic testing of these approximately 140 components shows that risk as modeled by the PRA is not dependent on the reliability of these components. This suggests that the PRA is relatively insensitive to the reliability of these components collectively and that they can be considered as candidates for significant relaxation of testing requirements, possibly including exclusion from the formal IST program.


2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Khaled Loukhaoukha ◽  
Jean-Yves Chouinard ◽  
Abdellah Berdai

In the past few years, several encryption algorithms based on chaotic systems have been proposed as means to protect digital images against cryptographic attacks. These encryption algorithms typically use relatively small key spaces and thus offer limited security, especially if they are one-dimensional. In this paper, we proposed a novel image encryption algorithm based on Rubik's cube principle. The original image is scrambled using the principle of Rubik's cube. Then, XOR operator is applied to rows and columns of the scrambled image using two secret keys. Finally, the experimental results and security analysis show that the proposed image encryption scheme not only can achieve good encryption and perfect hiding ability but also can resist exhaustive attack, statistical attack, and differential attack.


2017 ◽  
Author(s):  
Sankhanil Dey ◽  
Ranjan Ghosh

Substitution Box or S-Box had been generated using 4-bit Boolean Functions (BFs) for Encryption and Decryption Algorithm of Lucifer and Data Encryption Standard (DES) in late sixties and late seventies respectively. The S-Box of Advance Encryption Standard have also been generated using Irreducible Polynomials over Galois field GF(28) adding an additive constant in early twenty first century. In this paper Substitution Boxes have been generated from Irreducible or Reducible Polynomials over Galois field GF(pq). Binary Galois fields have been used to generate Substitution Boxes. Since the Galois Field Number or the Number generated from coefficients of a polynomial over a particular Binary Galois field (2q) is similar to log2q+1 bit BFs. So generation of log2q+1 bit S-Boxes is possible. Now if p = prime or non-prime number then generation of S-Boxes is possible using Galois field GF (pq ), where q = p-1.


Internet of Things (IoT) is a leading technology, where numerous sensors with the ability to exchange information over the internet are involved. It supports various applications ranging from smart home to smart city including smart grid for calculating electricity tariff, real time monitoring and controlling traffic, Co2 emission level finding etc. Research advancements in IoT facilitates us to control or monitor the things remotely and take actions accordingly. Efficient working of the IoT, involves continuous exchange of information between the nodes which should be executed in trusted environment as this data is confidential and only trusted nodes should handle it. Current research work in IoT suggests the confidentiality mechanisms which are heavyweight and not suitable in IoT scenario. So there is a need for lightweight confidentiality mechanism. In this paper we have shown how lightweight P-Box permutation encryption algorithm can be effective in IoT. We have compared this encryption algorithm with PRESENT protocol and our results show that lightweight P-Box permutation algorithm took less time. To prove that our encryption algorithm is better w.r.t. security, we have also carried out known plaintext attack and chosen plaintext attack and shown that lightweight P-Box permutation encryption algorithm is resistant to both of these attacks. Further we have used this technique to transfer the smart meter data in Smart Grid and shown that the data exchanged between the two nodes in confidential manner


Author(s):  
Nabilah Hani Abughazalah ◽  
Majid Khan

In this age of internet communication, the security of digital information is one of the main issues. The privacy of data depends upon the encryption using some secure algorithm. The selection of robust cryptosystems to ensure confidentiality is a major concern to decrease the risk of cryptographic attacks. In this article, we have implemented a grey theory-based decision-making technique for the election of a robust cryptosystem that complies with all the cryptographic parameters. Six different already proposed encryption algorithms are selected as the alternatives of the decision-making problem and the parameters concerned for the decision are entropy, correlation coefficient, the number of pixels changing rate (NPCR), unified average changing intensity (UACI). The algorithm ranked as first by using grey-based decision-making method can be utilized for secure data encryption.


Substitution box is the non-linear part in Symmetric Encryption Algorithm. It gives the various alternate methods for the construction of S-Box by taking AES Substitution Box as base or modified version of AES S-Box. Hence it is proving that either AES S-box or modified version such as Gray S-Box, S8 S-Box is also satisfying the important parameters of S-Box such as nonlinearity, SAC, Bit Independence Criterion, Diffusion Strength, Differential Approximation probability while we are encrypting both the text and image


Sign in / Sign up

Export Citation Format

Share Document