Recently several block ciphers are proposed which are based on the inversion mapping over binary ... more Recently several block ciphers are proposed which are based on the inversion mapping over binary Galois field with n-input. These proposed block ciphers are Camellia, AES, Square and Hierocrypt in which S-box over binary Galois field with n-input is used. Now with the passage of time it is necessary to increase the security of these blocks ciphers by increasing the key space which can be increased by generalizing this concept over non-binary Galois field with n-input. In this paper, we have designed an innovative techniques through which we can easily find element of nonlinear component of block cipher namely S-box through a single expression instead of matrix algebraic computations. Our main idea here is to reduce the computational complexity while performing calculations for S-box which is one of the most important nonlinear components for any modern block ciphers. Also, we have transformed our existing problem of being using matrix algebra to a symbolic single expression algebra which reduces the tedious calculations of S-boxes.
Journal of Intelligent and Fuzzy Systems, Jan 30, 2023
The reduction of constrained mathematical structures leads us to generalize any abstract structur... more The reduction of constrained mathematical structures leads us to generalize any abstract structures. Using minimum conditions to construct a secure and robust component of the modern encryption algorithm is one crucial problem in multimedia security. With this understanding, we have proposed a new algebraic structure, namely monogenic semigroup, to construct a digital information authentication scheme. Authentication is always completed at the beginning of the application, before any throttling or approval checks are performed, and before any other code is allowed to begin running in the background. Many authentication schemes offer a complex structure for implementation in cryptosystems and applications. The anticipated mechanism uses a simple mathematical structure having the least conditions as compared to other mathematical structures. The suggested scheme provides structures for the authentication of text messages and images.
Abstract Recently many substitution box based encryption algorithms ensuring privacy have been pr... more Abstract Recently many substitution box based encryption algorithms ensuring privacy have been proposed. Many, chaotic map based S-boxes have been generated posing high nonlinearity and strong cryptographic properties. Encryption schemes depending on the substitution box (S-box) only are weak and easily breakable with the help of chosen plaintext and ciphertext attacks. In this work, we have completely cryptanalyzed S-box based encryption scheme successfully by two types of attacks. Cryptanalysis in both types of attacks is performed by only one selected image. Moreover, we have suggested some improvements in the algorithm to defeat attacks.
In this article, we have designed a new scheme for the construction of the nonlinear confusion co... more In this article, we have designed a new scheme for the construction of the nonlinear confusion component. Our mechanism uses the notion of a semigroup, Inverse LA-semigroup, and various other loops. With the help of these mathematical structures, we can easily build our confusion component namely substitution boxes (S-boxes) without having specialized structures. We authenticate our proposed methodology by incorporating the available cryptographic benchmarks. Moreover, we have utilized the technique for order of preference by similarity to ideal solution (TOPSIS) to select the best nonlinear confusion component. With the aid of this multi-criteria decision-making (MCDM), one can easily select the best possible confusion component while selecting among various available nonlinear confusion components.
The reduction of constrained mathematical structures leads us to generalize any abstract structur... more The reduction of constrained mathematical structures leads us to generalize any abstract structures. Using minimum conditions to construct a secure and robust component of the modern encryption algorithm is one crucial problem in multimedia security. With this understanding, we have proposed a new algebraic structure, namely monogenic semigroup, to construct a digital information authentication scheme. Authentication is always completed at the beginning of the application, before any throttling or approval checks are performed, and before any other code is allowed to begin running in the background. Many authentication schemes offer a complex structure for implementation in cryptosystems and applications. The anticipated mechanism uses a simple mathematical structure having the least conditions as compared to other mathematical structures. The suggested scheme provides structures for the authentication of text messages and images.
Recently several block ciphers are proposed which are based on the inversion mapping over binary ... more Recently several block ciphers are proposed which are based on the inversion mapping over binary Galois field with n-input. These proposed block ciphers are Camellia, AES, Square and Hierocrypt in which S-box over binary Galois field with n-input is used. Now with the passage of time it is necessary to increase the security of these blocks ciphers by increasing the key space which can be increased by generalizing this concept over non-binary Galois field with n-input. In this paper, we have designed an innovative techniques through which we can easily find element of nonlinear component of block cipher namely S-box through a single expression instead of matrix algebraic computations. Our main idea here is to reduce the computational complexity while performing calculations for S-box which is one of the most important nonlinear components for any modern block ciphers. Also, we have transformed our existing problem of being using matrix algebra to a symbolic single expression algebra which reduces the tedious calculations of S-boxes.
Journal of Intelligent and Fuzzy Systems, Jan 30, 2023
The reduction of constrained mathematical structures leads us to generalize any abstract structur... more The reduction of constrained mathematical structures leads us to generalize any abstract structures. Using minimum conditions to construct a secure and robust component of the modern encryption algorithm is one crucial problem in multimedia security. With this understanding, we have proposed a new algebraic structure, namely monogenic semigroup, to construct a digital information authentication scheme. Authentication is always completed at the beginning of the application, before any throttling or approval checks are performed, and before any other code is allowed to begin running in the background. Many authentication schemes offer a complex structure for implementation in cryptosystems and applications. The anticipated mechanism uses a simple mathematical structure having the least conditions as compared to other mathematical structures. The suggested scheme provides structures for the authentication of text messages and images.
Abstract Recently many substitution box based encryption algorithms ensuring privacy have been pr... more Abstract Recently many substitution box based encryption algorithms ensuring privacy have been proposed. Many, chaotic map based S-boxes have been generated posing high nonlinearity and strong cryptographic properties. Encryption schemes depending on the substitution box (S-box) only are weak and easily breakable with the help of chosen plaintext and ciphertext attacks. In this work, we have completely cryptanalyzed S-box based encryption scheme successfully by two types of attacks. Cryptanalysis in both types of attacks is performed by only one selected image. Moreover, we have suggested some improvements in the algorithm to defeat attacks.
In this article, we have designed a new scheme for the construction of the nonlinear confusion co... more In this article, we have designed a new scheme for the construction of the nonlinear confusion component. Our mechanism uses the notion of a semigroup, Inverse LA-semigroup, and various other loops. With the help of these mathematical structures, we can easily build our confusion component namely substitution boxes (S-boxes) without having specialized structures. We authenticate our proposed methodology by incorporating the available cryptographic benchmarks. Moreover, we have utilized the technique for order of preference by similarity to ideal solution (TOPSIS) to select the best nonlinear confusion component. With the aid of this multi-criteria decision-making (MCDM), one can easily select the best possible confusion component while selecting among various available nonlinear confusion components.
The reduction of constrained mathematical structures leads us to generalize any abstract structur... more The reduction of constrained mathematical structures leads us to generalize any abstract structures. Using minimum conditions to construct a secure and robust component of the modern encryption algorithm is one crucial problem in multimedia security. With this understanding, we have proposed a new algebraic structure, namely monogenic semigroup, to construct a digital information authentication scheme. Authentication is always completed at the beginning of the application, before any throttling or approval checks are performed, and before any other code is allowed to begin running in the background. Many authentication schemes offer a complex structure for implementation in cryptosystems and applications. The anticipated mechanism uses a simple mathematical structure having the least conditions as compared to other mathematical structures. The suggested scheme provides structures for the authentication of text messages and images.
Uploads