Rijndael/AES

“…It works on bytes with an algebraic structure which is the finite field GF(2 8 ). Rijndael has been choosed by NIST for its resistance to linear and differential cryptanalysis [5].…”

Section: Introductionmentioning

confidence: 99%

Differential Fault Analysis on A.E.S

Dusart

Letourneux

Vivolo

2003

Applied Cryptography and Network Security

237

148

View full text Add to dashboard Cite

show abstract

“…Note that the result of [9] does not apply to Rijndael, since for Rijndael, B = 5 < M = 16) [5]. Tailoring our algorithm to any particular SPN involves computation of the values in W [ ] (Definition 7), which for Rijndael is a 2 16 ×2 16 table.…”

Section: Application Of New Upper Bound To Rijndaelmentioning

confidence: 99%

“…There has been a recent increase in interest in SPNs, in part because their simplicity lends itself to analysis, and, from an implementation viewpoint, because they tend to be highly parallelizable. This interest will no doubt be spurred on by the recent adoption of Rijndael (a straightforward SPN) as the U.S. Government Advanced Encryption Standard (AES) [5].…”

Section: Introductionmentioning

confidence: 99%

New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs

Keliher

Meijer

Tavares

2001

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptanalysis. The best previous result (Hong et al. [9]) applies only when the linear transformation branch number (B) is M or (M + 1) (maximal case), where M is the number of s-boxes per round. In contrast, our upper bound can be computed for any value of B. Moreover, the new upper bound is a function of the number of rounds (other upper bounds known to the authors are not). When B = M , our upper bound is consistently superior to [9]. When B = (M + 1), our upper bound does not appear to improve on [9]. On application to Rijndael (128-bit block size, 10 rounds), we obtain the upper bound UB = 2 −75 , corresponding to a lower bound on the data complexity of 8 UB = 2 78 (for 96.7% success rate). Note that this does not demonstrate the existence of a such an attack, but is, to our knowledge, the first such lower bound.

show abstract

“…Among these, finite field power operation based S-boxes achieve [3] several security criteria simultaneously, and have been used in many cipher proposals including Rijndael [14,15], major portfolio of NESSIE [19], ARIA [17] in Korea, and CRYPTREC [18] in Japan, mentioned only a few.…”

Section: Introductionmentioning

confidence: 99%

Improved Rijndael-Like S-Box and Its Transform Domain Analysis

Jin

Baek

Song

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we propose a simple scheme which produces a new S-box from a given S-box. We use the well-known conversion technique between the polynomial functions over F2n and the boolean functions from F n 2 to F2. We have applied the scheme to Rijndael S-box and obtained 29 new S-boxes, of which only one is a bijection with better algebraic expression than the original Rijndael S-box and has the same spectral properties as the original Rijndael S-box. All others turned out to be non-bijective, and have different spectral properties, and hence, they all are inequivalent to the original as boolean functions.

show abstract

Rijndael/AES

Cited by 239 publications

References 0 publications

Differential Fault Analysis on A.E.S

Differential Fault Analysis on A.E.S

New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs

Improved Rijndael-Like S-Box and Its Transform Domain Analysis

Contact Info

Product

Resources

About