S-Box Design Analysis and Parameter Variation in AES Algorithm

Kohli, Rashi; Sharma, Divya; Baliyan, Manoj Kr.

doi:10.5120/9667-4084

Cited by 4 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pseudorandom number generator based on chaotic maps is one of the emerging field nowadays and can be utilized in different cryptosystems to get more security [30]. In [21], the virtual analysis of Advanced Encryption Standard (AES), Data Encryption Standard (DES) and 3DES are presented. The scrutiny of AES is explained considering the high throughput, area efficiency and elevated performance [20,46].…”

Section: Related Workmentioning

confidence: 99%

“…As we have used 8 different S-boxes and the average maximum value of LP is LP max = 2 −4. 21 and having distinct 256 S-boxes the maximum LP is given as LP 4r max = 2 −4.21×256 = 2 −1077 . By seeing the outcomes of LP, it is almost impossible for an invader to differentiate our proposed cipher with the help of random permutation and hence, the proposed algorithm will show resistance for countering linear cryptanalysis.…”

Section: Differential Cryptanalysismentioning

confidence: 99%

See 1 more Smart Citation

A image encryption algorithm based on chaotic Lorenz system and novel primitive polynomial S-boxes

Al-Maadeed

Hussain

Anees

et al. 2021

Multimed Tools Appl

View full text Add to dashboard Cite

We have proposed a robust, secure and efficient image encryption algorithm based on chaotic maps and algebraic structure. Nowadays, the chaotic cryptosystems gained more attention due to their efficiency, the assurance of robustness and high sensitivity corresponding to initial conditions. In literature, there are many encryption algorithms that can simply guarantees security while the schemes based on chaotic systems only promises the uncertainty, both of them can not encounter the needs of current scenario. To tackle this issue, this article proposed an image encryption algorithm based on Lorenz chaotic system and primitive irreducible polynomial substitution box. First, we have proposed 16 different S-boxes based on projective general linear group and 16 primitive irreducible polynomials of Galois field of order 256, and then utilized these S-boxes with combination of chaotic map in image encryption scheme. Three chaotic sequences can be produced by the disturbed of Lorenz chaotic system corresponding to variables x, y and z. We have constructed a new pseudo random chaotic sequence ki based on x, y and z. The plain image is encrypted by the use of chaotic sequence ki and XOR operation to get a ciphered image. To show the strength of presented image encryption, some renowned analyses are performed.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Differential Cryptanalysismentioning

confidence: 99%

A image encryption algorithm based on chaotic Lorenz system and novel primitive polynomial S-boxes

Al-Maadeed

Hussain

Anees

et al. 2021

Multimed Tools Appl

View full text Add to dashboard Cite

show abstract

“…The authors also highlight the benefits of lightweight cryptographic algorithms and integrated 8-bit Kogge stone adder with x-tea to provide faster computation for large applications. The work of [41] also designed a variant of the AES S-Box to maximize performance, achieve high throughput, and utilize area efficiency. The problem of arithmetic implementations usually consuming exorbitant amounts of power is solved by implementing a solution for S-BOX construction based on Galileo's field.…”

Section: Development and Evaluationmentioning

confidence: 99%

Software Design and Experimental Evaluation of a Reduced AES for IoT Applications

2021

View full text Add to dashboard Cite

IoT devices include RFID tags, microprocessors, sensors, readers, and actuators. Their main characteristics are their limited resources and computing capabilities, which pose critical challenges to the reliability and security of their applications. Encryption is necessary for security when using these limited-resource devices, but conventional cryptographic algorithms are too heavyweight and resource-demanding to run on IoT infrastructures. This paper presents a lightweight version of AES (called LAES), which provides competitive results in terms of randomness levels and processing time, operating on GF(24). Detailed mathematical operations and proofs are presented concerning LAES rounds design fundamentals. The proposed LAES algorithm is evaluated based on its randomness, performance, and power consumption; it is then compared to other cryptographic algorithm variants, namely Present, Clefia, and AES. The design of the randomness and performance analysis is based on six measures developed with the help of the NIST test statistical suite of cryptographic applications. The performance and power consumption of LAES on a low-power, 8-bit microcontroller unit were evaluated using an Arduino Uno board. LAES was found to have competitive randomness levels, processing times, and power consumption compared to Present, Clefia, and AES.

show abstract

“…These transformations will take place sequentially, noting that the last round will include only three transformations which are SubBytes(), ShiftRows(), Addroundkey(). In the decryption process, transformations SubByte(), Shift Row(), and MixColumns() will be replaced by their inverse that are InvSubBytes(), InvShiftRows(),InvMixColumns(), and they take another arrangement [23].…”

Section: Structure Of Round In Aes Algorithmmentioning

confidence: 99%

A Novel Method to Increase Diffusion and Confusion in AES Algorithm

Mahrousa¹,

Bitar²,

Fareed³

2020

IJCA

View full text Add to dashboard Cite

The Advanced Encryption Standard (AES) is the most famous amongst symmetric block cipher algorithms, and the most used one in many different applications, because its encryption strength and its resistance to many attacks. In this paper, a novel approach will be introduced to remove some weakness points in AES and increase its security. Unlike most previous researches, this research will improve the most important and powerful part of AES algorithm which is the MixColumns() transformation. In the original AES, there only one function is used, which it creates a fixed array that is used in MixColumns() transformation, and this fixed array is known by attackers. Alternatively, the expanded secret key will be used to generate a different function at each round of AES. These functions will create a variable dynamic arrays at each round based on expanded secret key. The variable dynamic arrays will increase confusion amongst bits of the encrypted text. After that, the ShiftRow() transformation will be complicated from ShiftRow() with fixed pattern to ShiftRowColumn() with variable dynamic pattern according to expanded secret key. The modified ShiftRowColumn() will increase the diffusion amongst bytes of encrypted text, as will be detailed in experimental results.

show abstract

S-Box Design Analysis and Parameter Variation in AES Algorithm

Cited by 4 publications

References 6 publications

A image encryption algorithm based on chaotic Lorenz system and novel primitive polynomial S-boxes

A image encryption algorithm based on chaotic Lorenz system and novel primitive polynomial S-boxes

Software Design and Experimental Evaluation of a Reduced AES for IoT Applications

A Novel Method to Increase Diffusion and Confusion in AES Algorithm

Contact Info

Product

Resources

About