One Approach of Using Key-Dependent S-BOXes in AES

Stoianov, Nikolai

doi:10.1007/978-3-642-21512-4_38

Cited by 12 publications

(6 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“… Dynamic S-Box The dynamic S-Box put forward as recommended in the proposition in [24] is characterized as under:…”

Section: A S-box Based Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Implementation of Security Enhancement in AES by Inducting Dynamicity in AES S-Box

Nissar¹,

Garg²,

Khan*³

2019

IJITEE

View full text Add to dashboard Cite

Advance Encryption Standard (AES) supersedes Data Encryption Standard (DES) and is the best known and most widely used block cipher. As for now, there are no known practical attacks that would allow anyone to read correctly implemented AES encrypted data. However, several theoretical attacks have been announced until now. A theoretical attack called Biclique Attack is known to have broken Full AES and requires 2126.1 , 2189.7 , 2254.4 operations to recover an AES-128, AES-192, AES-256 respectively. Biclique Attack is faster than Brute force attack by a factor of four. As such, these theoretical attacks are of high computational complexity; they do not threaten the practical use of AES in any way. However, attacks always get better; they never get worse. As the technology evolves, successful attacks (using Quantum Computing and faster GPU) against AES may turn up, and they may be difficult to ignore. In this study, we aim to enhance the security prospects of AES with the inclusion of Dynamicity character in AES S-Box for increased resilience against Brute Force Attack and Biclique Attack, and hashing technique is combined with AES algorithm to achieve variance in security using MD4, SHA3 or SHA5. The novel key dispersion technique is introduced to increase the avalanche effect of AES algorithm.

show abstract

“… Dynamic S-Box The dynamic S-Box put forward as recommended in the proposition in [24] is characterized as under:…”

Section: A S-box Based Schemesmentioning

confidence: 99%

“…The absolute key size is 64 bits, and every 8 th bit of the key, i.e. 8,16,24,32,40,48,56 and 64 are eliminated from 64 bits with only 56-bit key left. Here, 8 bits are exclusively used for parity checking and hence neglected.…”

Section: Introductionmentioning

confidence: 99%

Implementation of Security Enhancement in AES by Inducting Dynamicity in AES S-Box

Nissar¹,

Garg²,

Khan*³

2019

IJITEE

View full text Add to dashboard Cite

show abstract

“…In 2011, Szaban and Seredynski [22] proposed cryptanalysis of a methodology to design dynamic cellular automata (CA)-based S-boxes. Stoianov [21] presented and analyzed an approach to change the S-boxes used in the algorithm AES. In 2013, Peng and Jin [18] proposed a cryptanalysis of a new method to design key-dependent S-boxes by using hyperchaotic Chen system.…”

Section: Introductionmentioning

confidence: 99%

Improved Slender-Set Linear Cryptanalysis

Liu

Jin

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In 2013, Borghoff et al. introduced a slender-set linear cryptanalysis on PRESENT-like ciphers with key-dependent secret S-boxes. In this paper, we propose an improved slender-set linear attack to PRESENTlike ciphers with secret S-boxes. We investigate three new cryptanalytic techniques, and use them to recover the secret S-boxes efficiently. Our first new idea is that we propose a new technique to support consistency of partitions of the input to the secret S-boxes. Our second new technique is that we present a more efficient method to recover the coordinate functions of secret S-boxes based on more information than that of Borghoff's attack. The third new technique is that we propose a method of constructing all correct coordinate function of secret S-boxes by pruning search algorithm. In particular, we implemented a successful linear attack on the full round Maya in practice. In our experiments, the correct S-box can be recovered with 2 36 known plaintexts, 2 18.9 time complexity and negligible memory complexity at a success rate of 87.5%. Our attack is the improvement and sequel of Borghoff's work on PRESENT-like cipher with secret S-boxes.

show abstract

“…Proposal 2: xAES The author in[27] put forward another scheme of key scheduling called xAES. The xAES is indistinguishable from the AES aside from the scheduling of key.…”

mentioning

confidence: 99%

Implementation of Security Enhancement in AES by Inducting Dynamicity in AES S-Box

Nissar¹,

Garg²,

Khan³

2019

IJITEE

View full text Add to dashboard Cite

Advance Encryption Standard (AES) supersedes Data Encryption Standard (DES) and is the best known and most widely used block cipher. As for now, there are no known practical attacks that would allow anyone to read correctly implemented AES encrypted data. However, several theoretical attacks have been announced until now. A theoretical attack called Biclique Attack is known to have broken Full AES and requires 2126.1 , 2 189.7 , 2254.4 operations to recover an AES-128, AES-192, AES-256 respectively. Biclique Attack is faster than Brute force attack by a factor of four. As such, these theoretical attacks are of high computational complexity; they do not threaten the practical use of AES in any way. However, attacks always get better; they never get worse. As the technology evolves, successful attacks (using Quantum Computing and faster GPU) against AES may turn up, and they may be difficult to ignore. In this study, we aim to enhance the security prospects of AES with the inclusion of Dynamicity character in AES S-Box for increased resilience against Brute Force Attack and Biclique Attack, and hashing technique is combined with AES algorithm to achieve variance in security using MD4, SHA3 or SHA5. The novel key dispersion technique is introduced to increase the avalanche effect of AES algorithm.

show abstract

One Approach of Using Key-Dependent S-BOXes in AES

Cited by 12 publications

References 1 publication

Implementation of Security Enhancement in AES by Inducting Dynamicity in AES S-Box

Implementation of Security Enhancement in AES by Inducting Dynamicity in AES S-Box

Improved Slender-Set Linear Cryptanalysis

Implementation of Security Enhancement in AES by Inducting Dynamicity in AES S-Box

Contact Info

Product

Resources

About